LeetCode-Binary Tree Level Order Traversal

最新推荐文章于 2020-05-13 15:27:42 发布

数据探险家

最新推荐文章于 2020-05-13 15:27:42 发布

阅读量991

点赞数

分类专栏： LeetCode OJ 文章标签： LeetCode

本文链接：https://blog.csdn.net/xin_jmail/article/details/39121593

版权

LeetCode OJ 专栏收录该内容

48 篇文章 0 订阅

订阅专栏

题目：https://oj.leetcode.com/problems/binary-tree-level-order-traversal/

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]
]

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

分析：使用两个队列来进行分层遍历。

源码：Java版本
算法分析：使用栈。时间复杂度O(n)，空间复杂度O(1)

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> results=new ArrayList<List<Integer>>();
        if(root==null) {
            return results;
        }
        Queue<TreeNode> currentQueue,nextQueue,tempQueue;
        currentQueue=new LinkedList<TreeNode>();
        nextQueue=new LinkedList<TreeNode>();
        currentQueue.add(root);
        TreeNode node;
        while(!currentQueue.isEmpty()) {
            List<Integer> list=new ArrayList<Integer>();
            while(!currentQueue.isEmpty()) {
                node=currentQueue.poll();
                list.add(node.val);
                if(node.left!=null) {
                    nextQueue.add(node.left);
                }
                if(node.right!=null) {
                    nextQueue.add(node.right);
                }
            }
            results.add(list);
            //swap currentQueue and nextQueue
            tempQueue=currentQueue; 
            currentQueue=nextQueue;
            nextQueue=tempQueue;
        }
        return results;
    }
}