一、问题
1
2 3
4 5 6
7
分层输出所有的节点
level:1 1
level:2 2 3
level:3 4 5 6
level:4 7
二、代码
Java
@Data
public class Node {
private Integer id;
private Node left;
private Node right;
private Integer level;
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);