Postorder traversal of a binary tree
A) first visits the root,then recursively traverses the left and right subtree
B) recursively traverses the left subtree,then visits the root,then traverses the right subtree
C) recursively traverses the left subtree,then traverses the right subtree,then visits the root
D) visits all the nodes according to their natural order

Question

Quizplus · Accepted Answer

Postorder traversal visits the left subtree recursively, then visits the right subtree recursively and finally visits the root. Therefore, the correct choice is C as it follows the order of visiting the left subtree, right subtree, and then the root.

Postorder Traversal of a Binary Tree