[LintCode/LeetCode] Binary Tree Level Order Traver

makeFoxPlay 發布于2019-08-14 15:48 / 3050人閱讀

Problem

Given a binary tree, return the level order traversal of its nodes" values. (ie, from left to right, level by level).

For example:
Given binary tree {3,9,20,#,#,15,7},

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

Note

用先入先出的Queue。用size標記每一層的結點數目并定向循環。

Solution

class Solution {
    public List> levelOrder(TreeNode root) {
        List> res = new ArrayList<>();
        if (root == null) return res;
        Queue queue = new LinkedList();
        queue.offer(root);
        while (!queue.isEmpty()) {
            int size = queue.size();
            List temp = new ArrayList<>();
            for (int i = 0; i < size; i++) {
                TreeNode cur = queue.poll();
                if (cur.left != null) queue.offer(cur.left);
                if (cur.right != null) queue.offer(cur.right);
                temp.add(cur.val);
            }
            res.add(temp);//for traversal II: res.add(0, temp);
        }
        return res;
    }
}

DFS

class Solution {
    public List> levelOrder(TreeNode root) {
        List> res = new ArrayList<>();
        dfs(root, 0, res);
        return res;
    }
    private void dfs(TreeNode root, int level, List> res) {
        if (root == null) return;
        if (level >= res.size()) res.add(new ArrayList()); //level >= res.size() ---- from 0 >= 0 to initialize
        res.get(level).add(root.val);
        dfs(root.left, level+1, res);
        dfs(root.right, level+1, res);
    }
}

From bottom

public class Solution {
    public ArrayList> levelOrderBottom(TreeNode root) {
        ArrayList> res = new ArrayList<>();
        if (root == null) return res;
        helper(root, res, 0);
        return res;
    }
    public void helper(TreeNode root, ArrayList> res, int index) {
        int size = res.size();
        if (index == size) {
            ArrayList curList = new ArrayList<>();
            curList.add(root.val);
            res.add(0, curList);
        }
        else res.get(size-index-1).add(root.val);
        if (root.left != null) helper(root.left, res, index+1);
        if (root.right != null) helper(root.right, res, index+1);
    }
}

GPU云服務器云服務器 binary-tree binary-search-tree Binary level

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。

轉載請注明本文地址：http://specialneedsforspecialkids.com/yun/66025.html

[LintCode/LeetCode] Binary Tree Zigzag Level Orde

Problem Given a binary tree, return the zigzag level order traversal of its nodes values. (ie, from left to right, then right to left for the next level and alternate between). Example Given binary tr...

AlphaGooo 2019-08-14 15:40 評論0 收藏0
[LintCode/LeetCode] Construct Binary Tree from Tr

摘要：做了幾道二分法的題目練手，發現這道題已經淡忘了，記錄一下。這道題目的要點在于找的區間。邊界條件需要注意若或數組為空，返回空當前進到超出末位，或超過，返回空每次創建完根節點之后，要將加，才能進行遞歸。 Construct Binary Tree from Inorder and Preorder Traversal Problem Given preorder and inorder t...

馬忠志 2019-08-14 15:40 評論0 收藏0
[LintCode/LeetCode] Flatten Binary Tree to Linked

Problem Flatten a binary tree to a fake linked list in pre-order traversal.Here we use the right pointer in TreeNode as the next pointer in ListNode. Example 1 1 ...

TNFE 2019-08-14 15:12 評論0 收藏0
[LintCode/LeetCode] Balanced Binary Tree

摘要：根據二叉平衡樹的定義，我們先寫一個求二叉樹最大深度的函數。在主函數中，利用比較左右子樹的差值來判斷當前結點的平衡性，如果不滿足則返回。 Problem Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as...

morgan 2019-08-14 15:33 評論0 收藏0
[LintCode/LeetCode] Binary Tree Pruning

Problem Binary Tree PruningWe are given the head node root of a binary tree, where additionally every nodes value is either a 0 or a 1. Return the same tree where every subtree (of the given tree) not...

rockswang 2019-08-16 12:37 評論0 收藏0