tree 429_589_590_1302

这几道都很简单，都可以用递归或队列迭代的方法

429. N-ary Tree Level Order Traversal

将n叉树每层作为一个数组，返回所以层。

使用队列迭代法很容易想出来，但其实也可以使用递归法，就是记录递归进入的每一层的高度，然后将该层每个数字加入对应列表中：

public List<List<Integer>> levelOrder(Node root) {
    List<List<Integer>> res = new ArrayList<>();
    if (root == null)
        return res;
    Queue<Node> deque = new LinkedList<>();
    deque.add(root);

    while (!deque.isEmpty()){
        int num = deque.size();
        List<Integer> list = new ArrayList<>();

        while (num > 0) {
            Node temp = deque.remove();
            list.add(temp.val);
            deque.addAll(temp.children);
            num--;
        }
        res.add(list);
    } 
    return res;
}

589. N-ary Tree Preorder Traversal

n叉树前序遍历。

List<Integer> res = new ArrayList<>();
public List<Integer> preorder(Node root) {
    if (root == null) return res;
    helper(root);
    return res;
}

public void helper(Node root) {
    res.add(root.val);
    for (int i = 0; i < root.children.size(); i++) {
        helper(root.children.get(i));
    }
}

590. N-ary Tree Postorder Traversal

n叉树后序遍历。

List<Integer> res = new ArrayList<>();
public List<Integer> postorder(Node root) {
    if (root == null) return res;
    helper(root);
    return res;
}

public void helper(Node root) {
    for (int i = 0; i < root.children.size(); i++) {
        postorder(root.children.get(i));
    }
    if (root != null)
        res.add(root.val);
}

1302. Deepest Leaves Sum

求在最深层的叶子结点之和。

public int deepestLeavesSum(TreeNode root) {
    if (root == null) return 0;
     
     helper(root, 1);
     return sum;
}

int height = 0;
int sum = 0;
public void helper(TreeNode root, int h) {
     if (root == null) return;
    if (h > height) {
        height = h;
        sum = root.val;
    } else if (h == height) {
        sum += root.val;
    }
     helper(root.left, h+1);
     helper(root.right, h+1);
}