Page 1: Question 16 1 2 3 A heap must be a full binary tree. True 4 5 6 False Question 17 7 8 9 In a directed graphs (also called a digraph), it may not be possible to get from one vertex to another....

Extracted text: Page 1: Question 16 1 2 3 A heap must be a full binary tree. True 4 5 6 False Question 17 7 8 9 In a directed graphs (also called a digraph), it may not be possible to get from one vertex to another. 10 11 12 True False 13 14 15 More Short Answers 16 17 18 Question 18 For a 2-3-4 tree , after inserting the following letters in the order given: B, E, A, N, S - which value(s) 19 20 will be at the root? Which value(s) will be in the left child? Which value(s) will be in the right child?