剑指offer——从上往下打印二叉树

题目描述

从上往下打印出二叉树的每个节点，同层节点从左至右打印。

package com.sunny.offer;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;

class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;
    }
}
public class arraylist2 {

	public static void main(String[] args) {
		TreeNode node1 = new TreeNode(1);
		TreeNode node2 = new TreeNode(2);
		TreeNode node3 = new TreeNode(3);
		TreeNode node4 = new TreeNode(4);
		TreeNode node5 = new TreeNode(5);
		TreeNode node6 = new TreeNode(6);
		TreeNode node7 = new TreeNode(7);
		
		node1.left = node2;
		node1.right = node3;
		node2.left = node4;
		node2.right = node5;
		node3.left = node6;
		node3.right = node7;
		System.out.println(PrintFromTopToBottom(node1));

	}
	public static ArrayList<Integer> PrintFromTopToBottom(TreeNode root) {
        Queue<TreeNode> queue = new LinkedList<>();
        ArrayList<Integer> arrayList = new ArrayList<Integer>();
        
        if(root == null){
        	return arrayList;
        }
        
        queue.offer(root);
        
        while(queue != null){
        	TreeNode node = queue.poll();
        	if(node == null){
        		break;
        	}
        	arrayList.add(node.val);
        	
        	 if(node.left != null){
             	queue.offer(node.left);
             }
             if(node.right != null){
             	queue.offer(node.right);
             }
        }
        return arrayList;
    }

}