Preorder tree walk

Summary

• In Computer Science PreOrder Tree Walk refers to the algorithm of a binary search tree that traverses the tree in a manner that the root of the subtree is printed before the values in its left subtree and the right subtree.

Similar Topics

• Postorder tree walk
• Inorder tree walk
• Preorder
• Dead Men Walk
• The Walk
• Learning to Walk
• Total preorder
• Five Weirs Walk
• Tunnel Walk
• The Walk Ons

Related Topics

• Binary search tree
• Computer science
• The Tree

  * This page is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Preorder tree walk".