Which traversal algorithm visits a Binary Search Tree (BST) nodes in strict ascending sorted key order?
APre-order Traversal
BIn-order Traversal
CPost-order Traversal
DLevel-order Traversal
Explanation
In-order Traversal (Left subtree -> Root node -> Right subtree) visits nodes of a Binary Search Tree in sorted ascending order. Pre-order is used for cloning, and Post-order for node deletion.
Exam Relevance
- Topic: Data Structures & Algorithms
- Subtopic: Tree Traversals
No Comments