If you add the following nodes to a binary search tree in the order they appear (left-to-right): 6 34 17 19 16 10 23 3
What will be the output of a postorder traversal of the resulting tree?
A) 3 10 16 23 19 17 34 6
B) 3 6 17 16 10 19 23 34
C) 6 3 34 17 16 10 19 23
D) 10 16 23 19 17 34 3 6

Question

Quizplus · Accepted Answer

In a postorder traversal, nodes are visited in the order of left child, right child, and then the parent node. After adding the nodes to a binary search tree in the given order, the tree structure will be such that 3, 10, 16, 23, 19, 17, 34, and finally 6 are visited in this sequence during a postorder traversal.

If You Add the Following Nodes to a Binary Search