The three traversal algorithms discussed for binary trees are ____, ____, and ____.
A) order, preorder, postorder
B) in, preorder, order
C) order, preorder, post
D) inorder, preorder, postorder

Question

Quizplus · Accepted Answer

Inorder, preorder, and postorder are the standard traversal algorithms for binary trees. Inorder traversal visits the left subtree, the current node, and then the right subtree. Preorder traversal visits the current node, the left subtree, and then the right subtree. Postorder traversal visits the left subtree, the right subtree, and then the current node.

The Three Traversal Algorithms Discussed for Binary Trees Are ____