大家好，又见面了，我是你们的朋友全栈君。
public class Node {
private int value;
private Node lchild;
private Node rchild;
public int getValue() {
return value;
}
public void setValue(int value) {
this.value = value;
}
public Node getLchild() {
return lchild;
}
public void setLchild(Node lchild) {
this.lchild = lchild;
}
public Node getRchild() {
return rchild;
}
public void setRchild(Node rchild) {
this.rchild = rchild;
}
@Override
public String toString() {
return “Node [value=” + value + “]”;
}
}
import java.util.LinkedList;
import java.util.Queue;
public class Main {
public static void show(Node node) {
Queue<Node> queue = new LinkedList<>();
if (node == null) {
return;
}
queue.offer(node);
while (queue.peek() != null) {
Node n = queue.poll();
System.out.print(n.getValue());
if (n.getLchild() != null) {
queue.offer(n.getLchild());
}
if (n.getRchild() != null) {
queue.offer(n.getRchild());
}
}
}
public static void main(String[] args) {
Node[] nodes = new Node[10];
for (int i = 1; i < nodes.length; i++) {
Node n = new Node();
n.setValue(i);
nodes[i] = n;
}
nodes[1].setLchild(nodes[2]);
nodes[1].setRchild(nodes[3]);
nodes[2].setLchild(nodes[4]);
nodes[2].setRchild(nodes[5]);
nodes[3].setLchild(nodes[6]);
nodes[3].setRchild(nodes[7]);
nodes[4].setLchild(nodes[8]);
nodes[5].setRchild(nodes[9]);
show(nodes[1]);
}
}
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/143600.html原文链接：https://javaforall.net
