二叉树的层序遍历

import java.util.*;
class TreeNode {

public char value;
public TreeNode left;    //   节点地址
public TreeNode right;


//  调用它的构造方法
public TreeNode(char value){
    this.value = value;
    this.left = null;
    this.right = null;
}

}
/**
* 二叉树的层序遍历
* @param root
*/

void levelOrderTraversal(TreeNode root) {
    
    if (root == null) {
        return;
    }
    Queue<TreeNode> queue =new LinkedList<>();
    queue.offer(root);

    while (!queue.isEmpty()) {
        TreeNode cur = queue.poll();
        if (cur != null) {
            System.out.print(cur.value+" ");
            if (cur.left != null) {
                queue.offer(cur.left);
            }
            if (cur.right != null) {
                queue.offer(cur.right);
            }
        }
    }
}