Preorder Traversal
Preorder traversal is a depth-first search algorithm for a binary search tree that first traverses the root, then the left subtree, and then the right subtree. Its primary use is to create a copy of the tree.
Algorithm
The preorder algorithm can be described as follows:
Function Preorder(tree)
return root + Preorder(left-subtree) + Preorder(right-subtree)
Example
For the following binary search tree:
Preorder traversal provides the nodes in the following order: 4
, 2
, 1
, 3
, 6
, 5
, 7
.
All contributors
- garanews222 total contributions
- StevenSwiniarski475 total contributions
Looking to contribute?
- Learn more about how to get involved.
- Edit this page on GitHub to fix an error or make an improvement.
- Submit feedback to let us know how we can improve Docs.