36：从上到下打印二叉树

从上到下打印二叉树

这个题目也就是二叉树的层次遍历，使用队列来做

public class Offer37 {

   public static void cengci(TreeNode root){
       if(root==null)return;
       LinkedList<TreeNode> queue = new LinkedList<>();
       queue.add(root);
       while (!queue.isEmpty()){
           TreeNode remove = queue.removeFirst();
           System.out.println(remove.value);
           if(remove.left!=null)
           queue.add(remove.left);
           if(remove.right!=null)
           queue.add(remove.right);
       }
   }

   public static void main(String[] args) {
       TreeNode root = Main.createNode();
       cengci(root);
   }

}