Java 代码实现 二叉树
数据存储规则
- 左子树上的所有节点值均小于根节点值
- 右子树上的所有节点值均不小于根节点值
- 左右子树也满足上述两个条件
节点类 Node.java
public class Node {
private String data;
private Node left;
private Node right;
public Node(final String data) {
this.data = data;
}
public void setData(final String data) {
this.data = data;
}
public String getData() {
return this.data;
}
public void setLeft(final Node left) {
this.left = left;
}
public Node getLeft() {
return this.left;
}
public void setRight(final Node right) {
this.right = right;
}
public Node getRight() {
return this.right;
}
public void addNode(final Node newNode) {
if (newNode.data.compareTo(this.data) < 0) {
if (this.left == null) {
this.left = newNode;
} else {
this.left.addNode(newNode);
}
} else {
if (this.right == null) {
this.right = newNode;
} else {
this.right.addNode(newNode);
}
}
}
public void printNode() {
if (this.left != null) {
this.left.printNode();
}
System.out.println(this.data);
if (this.right != null) {
this.right.printNode();
}
}
}
操作功能类 Binary.java
public class Binary {
private Node root;
public void add(String data) {
if (data == null) {
return;
}
Node newNode = new Node(data);
if (this.root == null) {
this.root = newNode;
} else {
this.root.addNode(newNode);
}
}
public void print() {
if (this.root != null) {
this.root.printNode();
}
}
}
App.java
public class App {
public static void main(String[] args) {
final Binary binary = new Binary();
binary.add("馒头");
binary.add("2");
binary.add("豆浆");
binary.add("茶叶蛋");
binary.add("包子");
binary.add("1");
binary.add("4");
binary.add("麻花");
binary.add("3");
binary.add("3");
binary.add("茶叶蛋");
binary.print();
}
}
结果:
> 1
> 2
> 3
> 3
> 4
> 包子
> 茶叶蛋
> 茶叶蛋
> 豆浆
> 馒头
> 麻花
如果您觉得有帮助,欢迎点赞哦 ~ 谢谢!!