how can we build tree from level order traversal?
Build tree from level order
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 
@varu i hope its cleared if yes dont forget to mark the doubt as resolved