Repeatedly delete the root node of this Binary Search Tree(BST) until the tree is empty and display intermediate trees each time after deletion

We have seven BST nodes whose keys are {0, 1, 2, 3, 4, 5, 6} [login to view URL] a Driver class [login to view URL], which builds BST T2 containing these seven nodes where the height of the tree is minimal. The program displays intermediate trees (i.e., each time after insertion, the resulting BST is printed out). 2. Write a Driver class [login to view URL], which takes T2 as its input, repeatedly deletes the root note until the tree is empty. The program displays intermediate trees (i.e., each time after insertion, the resulting BST is printed out). I already finished [login to view URL] which displayed below. The tree is displayed level by level from the root. At each level, a node is followed by an indicator of its parent node Output for [login to view URL]: level 0: 3(root) level 1: 1(left of 3) level 0: 3(root) level 1: 1(left of 3) 5(right of 3) level 0: 3(root) level 1: 1(left of 3) 5(right of 3) level 2: 0(left of 1) level 0: 3(root) level 1: 1(left of 3) 5(right of 3) level 2: 0(left of 1) 2(right of 1) level 0: 3(root) level 1: 1(left of 3) 5(right of 3) level 2: 0(left of 1) 2(right of 1) 4(left of 5) level 0: 3(root) level 1: 1(left of 3) 5(right of 3) level 2: 0(left of 1) 2(right of 1) 4(left of 5) 6(right of 5) I need [login to view URL] to be completed and need the BST display a new tree after each deletion of the root node. Desired Output for [login to view URL]: level 0: 3(root) level 1: 1(left of 3) 5(right of 3) level 2: 0(left of 1) 2(right of 1) 4(left of 5) 6(right of 5) level 0: 4(root) level 1: 1(left of 4) 5(right of 4) level 2: 0(left of 1) 2(right of 1) 6(right of 5) level 0: 2(root) level 1: 1(left of 2) 5(right of 2) level 2: 0(left of 1) 6(right of 5) level 0: 1(root) level 1: 0(left of 1) 5(right of 1) level 2: 6(right of 5) level 0: 5(root) level 1: 0(left of 5) 6(right of 5) level 0: 0(root) level 1: 6(right of 0) level 0: 6(root) null Tree is now empty