Level Order Traversal of Binary Tree

[Arghya-Chakraborty0812]

Fixes#1466
Level order Traversal of Binary tree.
Algorithm:

1. Build Tree: Starting with the root node, ask the user to input values for each node.
   • For each node, take user input to determine its left and right children.
   • If the input is -1, that child is considered NULL (no node).
2. Level Order Traversal:
   • Initialize a queue to hold nodes at each level.
   • For each node in the queue:
     • Print the node’s value.
     • Add its left and right children to the queue (if they exist).
   • Each level is printed on a new line.
     Please review and merge my PR with appropriate tags.
     Thanks

[pankaj-bind]

delete middle program file

[Arghya-Chakraborty0812]

@pankaj-bind Changes done

[pankaj-bind]

#1466