Someone please help me in taking of input of the LeftView of binary tree problem
How to input for LeftView of the tree problem
hey @Mukul70
Level order input is taken and tree is build by using the queue, in which firstly u will take a queue of nodes, and then it will have a data which will represent a root node, and then u will accept the left and right child of root node, -1 value means that the node does not have any child.
U can refer to this code for your help
Thanks you brother, This was very helpful