Q1. Let us assume, we have a binary search tree whose breadth first traversal is 5, 3, 10, 2, 4, 7, 11, 1, 6, 9, 12, 8 with following conditions that 2 and 9 have no right child while 1, 4, 6, 8, and 12 are the leaf nodes. If we remove node 5, which node shall have a balancing factor of +2

Q2.Let us assume, we have a binary search tree whose breadth first traversal is 5, 3, 10, 2, 4, 7, 11, 1, 6, 9, 12, 8 with following conditions that 2 and 9 have no right child while 1, 4, 6, 8, and 12 are the leaf nodes. If we remove node 5, what would be breadth first traversal of the resulting binary search tree.

Q3.If we remove node 5, what would be the breadth first traversal of the resulting AVL balanced tree

*Please explain every step in the solution * Draw the resulting tree and justify your answer