This is the tree before any key is inserted: 22 18 44 20 50 How will the tree look after the key 19 is inserted? a. 22 b. C. d. 18 44 19 44 18 44 18 44 19 20 50 18 20 50 20 50 19 50 19 20 Every subtree of a Binary Search Tree (BST) is another BST. True False In questions 3-6, assume that start is an instance of the LinkList class, and every link only has long dData as data item. its current state looks like this: start 22 Also assume that this method is defined: 33 44 55 66 void print (Link n) 1 while (n = null) System.out.print (n.data + " "); nn.next; What will the output be from this code: start.next start.next.next; print (start); 22, 33, 44, 55, 66 What is the height of this tree: (D K E A L H B F F A B E D What is the Breadth First Search of this graph? ABCDEF ABDCEF ABDFEC ABDFCE C QUESTION 15 What is the Depth First Search of the graph in Question 14? ABCDEF ABDCEF ABDFEC ABDFCE QUESTION 16 How many different binary search trees could result from inserting the three keys 1, 2, and 3 in different orders? 3