DISTRIBUTED MINDS
PACKING THE TREE
O(N)
Time — every node is visited once, in and out.
O(N)
Space — string length and recursion depth.
↺
▶