Binary Trees
Each node has at most two children; traversed in-order, pre-order, post-order or level-order.
Easy
def inorder(node):
if node:
inorder(node.left)
print(node.value)
inorder(node.right)
- Pre-order (node, left, right) — copy a tree.
- In-order (left, node, right) — sorted order for a BST.
- Post-order (left, right, node) — delete a tree, evaluate expressions.
- Level-order — breadth-first, using a queue.
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.