树的层次遍历 (Java)

一、问题

              1
       2             3
         4         5  6
                 7

输出该树层次遍历的结果

1    2    3    4    5    6    7    
 

 

二、代码

Java

@Data
public class Node {
    private Integer id;
    private Node left;
    private Node right;

    public Node(Integer id) {
        this.id = id;
    }

    public Node(Integer id, Node left, Node right) {
        this.id = id;
        this.left = left;
        this.right = right;
    }
}




@Data
public class Tree {
    private Node root;

    /**
     * 建树 【V80】
     *
     *              1
     *       2             3
     *         4         5  6
     *                 7
     */
    public void build() {
        Node node7 = new Node(7);
        Node node6 = new Node(6);
        Node node5 = new Node(5, node7, null);
        Node node4 = new Node(4);
        Node node3 = new Node(3, node5, node6);
        Node node2 = new Node(2, null, node4);
        root = new Node(1, node2, node3);
    }

    /**
     * 层次遍历
     */
    public void levelOrder(Node root) {
        if (root == null) {
            return;
        }

        List<Node> allNodes = new ArrayList<>();

        Queue<Node> queue = new LinkedList<>();
        queue.offer(root);

        while (!queue.isEmpty()) {
            Node head = queue.poll();
            if (head.getLeft() != null) {
                queue.offer(head.getLeft());
            }

            if (head.getRight() != null) {
                queue.offer(head.getRight());
            }
            allNodes.add(head);
        }

        for(int i=0; i< allNodes.size(); i++) {
            System.out.print(allNodes.get(i).getId() + "    ");
        }
    }



    public static void main(String[] args) {
        Tree tree = new Tree();
        tree.build();

        tree.levelOrder(tree.getRoot());
    }
}

运行结果

1    2    3    4    5    6    7    
 

三、扩展

     树：求树的层数 (Java)

     树：输出所有节点的层数 (Java)

     树：分层输出所有的节点 (Java)

     树：获取某一层的所有节点 (Java)