Preorder Traversal

1void preorder(Node node, List<Integer> out) {2  if (node == null) return;  // Empty subtree, stop3  out.add(node.val);  // Visit node first4  preorder(node.left, out);  // Traverse left subtree5  preorder(node.right, out);  // Traverse right subtree6}