[leetcode]Binary Tree Zigzag Level Order Traversal

树的BFS变种算法实现

最新推荐文章于 2021-02-05 11:10:39 发布

weixin_30678821

最新推荐文章于 2021-02-05 11:10:39 发布

阅读量65

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/lautsie/p/3327243.html

本文介绍了一种树的BFS算法的简单变种，通过改变层次遍历方式，实现了树节点的非顺序输出。

树的BFS的简单变种。

public class Solution {
    public ArrayList<ArrayList<Integer>> zigzagLevelOrder(TreeNode root) {
        ArrayList<ArrayList<Integer>> ans = new ArrayList<ArrayList<Integer>>();
        if (root == null) return ans;
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.offer(root);
        int lastLevel = 1;
        int thisLevel = 0;
        boolean direction = true;
        
        ArrayList<Integer> row = new ArrayList<Integer>();
        while (queue.size() != 0)
        {
            TreeNode n = queue.poll();
            lastLevel--;
            if (n.left != null)
            {
                queue.offer(n.left);
                thisLevel++;
            }
            if (n.right != null)
            {
                queue.offer(n.right);
                thisLevel++;
            }
            row.add(n.val);
            if (lastLevel == 0)
            {
                lastLevel = thisLevel;
                thisLevel = 0;
                if (!direction)
                {
                    // reverse
                    int len = row.size();
                    for (int i = 0; i < len/2; i++)
                    {
                        int tmp = row.get(i);
                        row.set(i, row.get(len-1-i));
                        row.set(len-1-i, tmp);
                    }
                }
                direction = !direction;
                ans.add(row);
                row = new ArrayList<Integer>();
            }
        }
        return ans;
    }
}

转载于:https://www.cnblogs.com/lautsie/p/3327243.html