Loading…
Loading…
Visits Node → Left → Right. Useful for copying a tree or serialising its structure.
Preorder: Node → Left → Right.
Output: []
1void preorder(Node node, List<Integer> out) {2 if (node == null) return;3 out.add(node.val);4 preorder(node.left, out);5 preorder(node.right, out);6}