N-ary Tree Preorder Traversal LeetCode solution in Python

1
function preorder(root: Node | null): number[] {
2
  const res: number[] = [];
3

4
  const getNodeVal = (node: Node | null): void => {
5
    if (node) {
6
      res.push(node.val);
7

8
      for (let i = 0; i < node.children.length; i++) {
9
        getNodeVal(node.children[i]);
10
      }
11
    }
12
  };
13

14
  getNodeVal(root);
15

16
  return res;
17
}
18