The listing of nodes after applying the preorder traversal over the following binary tree is:
The listing of nodes after applying the preorder traversal over the following binary tree is:
A is the root. A has left child B and right child C. B has left child D and right child E. C has left child F and right child G. D has children H (left) and I (right). E has children J (left) and K (right). F has a single left child L.
Show answerHide answer
Correct answer: (D) A, B, D, H, I, E, J, K, C, F, L, G