Multiple Choice
Consider the following binary search tree: 
Which of the following sequences correctly represents preorder traversal of this tree?
A) J, E, M, A, G, P, C, H, N
B) A, C, H, G, E, N, P, M, J
C) J, E, A, G, C, H, M, P, N
D) A, C, E, G, H, J, M, N, P
Correct Answer:
Verified
Correct Answer:
Verified
Q4: Consider the following binary search tree: <img
Q5: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"
Q6: Consider a balanced binary tree with 520
Q7: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"
Q8: If a min-heap has 14 nodes, what
Q10: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"
Q11: If both of the child references of
Q12: The nodes in our binary search tree
Q13: The height of a tree can be
Q14: Consider the following Huffman encoding tree: <img