Which type of binary tree traversal traverses the left subtree, traverses the right subtree, and then visits the root node?
A) postorder traversal
B) inorder traversal
C) preorder traversal
D) unordered traversal

Question

Quizplus · Accepted Answer

Postorder traversal visits the left subtree, then the right subtree, and finally the root node. This traversal is useful when we want to perform some action after visiting both left and right subtrees.

Which Type of Binary Tree Traversal Traverses the Left Subtree