zoukankan      html  css  js  c++  java
  • 从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。

    import java.util.ArrayList;
    import java.util.Queue;
    import java.util.LinkedList;
    
    /*
    public class TreeNode {
        int val = 0;
        TreeNode left = null;
        TreeNode right = null;
    
        public TreeNode(int val) {
            this.val = val;
    
        }
    
    }
    */
    public class Solution {
        ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
    
            ArrayList<ArrayList<Integer> > List=new ArrayList<ArrayList<Integer> >();
            
            Queue <TreeNode> queue =new LinkedList<>();
            if(pRoot==null)
                return List;
            queue.offer(pRoot);
            while(!queue.isEmpty())
            {
                int size=queue.size();
                ArrayList<Integer> list=new ArrayList<>();
                while(size>0)
                {
                    TreeNode node = queue.poll();
                    list.add(node.val);
                    if(node.left!=null) queue.offer(node.left);
                    if(node.right!=null) queue.offer(node.right);
                    size--;
                }
                List.add(list);
            }
            
            return List;
        }
        
    }
  • 相关阅读:
    放缩ImageView
    2017/5/3 afternoon
    2017/5/3 morning
    2017/5/2 afternoon
    2017/5/2 morning
    2017/4/28 afternoon
    2017/4/28 morning
    2017/4/27 afternoon
    2017/4/27 morning
    2017/4/26 afternoon
  • 原文地址:https://www.cnblogs.com/lemonzhang/p/12676487.html
Copyright © 2011-2022 走看看