Question 9 Which trees are full and complete? U U C E G E H B H 1 pts Question 10 U Which trees are balanced but NOT complete? A B E U I B G D H 1 pts Question 11 U Which trees are full but NOT complete? T U U | 1 A U E TI E G F B 1 pts Question 12 B H E A F 1 pts List all nodes in pre-order traversal in the blank without spaces and all letters must be capitalized. Question 13 B H E A F G 1 pts List all nodes in in-order traversal in the blank without spaces and all letters must be capitalized. Question 14 B H E A F 1 pts List all nodes in post-order traversal in the blank without spaces and all letters must be capitalized. In programming assignment #3, we assume the current sorted linked list has data type as String and 4 elements as below: (assume that insert method is implemented correct as instructed) 1 O [10, 1, 2, 3, 4] O [1, 2, 3, 4, 10] O [1, 10, 2, 3, 4] 2 O [10, 2, 3, 4] 3 Tail We are going to insert an element with the value "10". What is the output when we print the linked list? 4