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

Question

Quizplus · Accepted Answer

Inorder traversal follows the left subtree, visits the root, and then the right subtree. It is called inorder because it visits the nodes in the order they appear in an in-order traversal of the tree. This type of traversal results in visiting the nodes in ascending order when performing the traversal on a binary search tree.

Which Type of Binary Tree Traversal Traverses the Left Subtree