Preorder Traversal
An interactive, step-by-step visualisation of Preorder Traversal.
- Category
- Trees
- Time complexity
- O(n)
- Space complexity
- O(h)
Pseudocode
preorder(t): visit(t) preorder(t.left) preorder(t.right)
Reference implementation
def preorder(t, out):
if not t: return
out.append(t.v)
preorder(t.l, out); preorder(t.r, out)