pre-order traversal
Pre-order traversal refers to a method used to traverse or visit nodes in a binary tree. It is one of the three main depth-first search strategies. In pre-order traversal, the root node is processed first, followed by the left sub-tree, and then the right sub-tree. This approach allows us to explore the tree by examining the nodes in the order of their appearance.
Requires login.
Related Concepts (1)
Similar Concepts
- depth-first search
- directory traversal
- in-order traversal
- in-order traversal of binary trees
- inorder traversal
- iterative tree traversal
- path traversal
- post-order traversal
- post-order traversal of binary trees
- postorder traversal
- pre-order traversal of binary trees
- preorder traversal
- recursive tree traversal
- tree recursion
- tree traversal