3 ms·
For me, tree traversal is beautiful. traverse(node): if node: [ ...traverse(node.left), ...traverse(node.right),
by _nalply 2y ago
For me, tree traversal is beautiful.
traverse(node):
if node:
[
...traverse(node.left),
...traverse(node.right),
node.value,
]
The pseudo-code recursively produces a list of the node values in post-order.