Visible Nodes in Binary Tree

Given a binary tree, you need to determine how many nodes are 'visible' from the left side of the tree. A node is considered visible if it is the leftmost node at its level when viewed from the left side. Write a function that reads the binary tree from standard input in level-order format (where '#' denotes a null node) and prints the count of visible nodes. Input format: - The first line contains a space-separated list of values representing the binary tree in level-order. Output format: - A single integer representing the count of visible nodes. Example: Input: 1 2 3 # 5 # # Output: 2