层次遍历二叉树

package tree;

import java.util.LinkedList;

public class LevelOrder {

	/**
	 * 层次遍历二叉树
	 * @param args
	 */
	public static void levelorder(TreeNode root){
		if(root==null) return;
		LinkedList<TreeNode> list = new LinkedList<>();
		list.add(root);
		while(!list.isEmpty()){
			TreeNode node = list.removeFirst();
			System.out.print(node.value+" ");
			if(node.left!=null){
				list.add(node.left);
			}
			if(node.right!=null){
				list.add(node.right);
			}
		}
	}
	public static void main(String[] args) {
		
		TreeNode root = new TreeNode(1);
		root.left = new TreeNode(2);
		root.right = new TreeNode(3);
		root.left.left = new TreeNode(4);
		root.left.right = new TreeNode(5);
		levelorder(root);

	}

}