Day 23: BST Level-Order Traversal For Explanation Check Video: Sample Input 6 3 5 4 7 2 1 Sample Output 3 2 5 1 4 7 Code: import java.util.*; import java.io.*; class Node{ Node left,right; int data; Node( int data){ this .data=data; left=right=null; } } class Solution{ static void levelOrder(Node root){ Queue<Node> queue = new LinkedList<>(); queue.add(root); while (queue.peek()!=null){ Node node = queue.remove(); System.out.print(node.data+ " " ); if (node.left!=null){ queue.add(node.left); } if (node.right!=null){ queue.add(node.right); } } } public static Node insert(Node root, int data){ if (root==null){ return new Node(data); } else { Node cur; if (data<=root.data){ cur=insert(root.left,data); root.left=