public class BST {
public static void main(String[] args) {
int[]arr={7,3,10,12,5,1,9};
BinarySortTree binarySortTree=new BinarySortTree();
for (int i = 0; i < arr.length; i++) {
binarySortTree.add(new Node(arr[i]));
}
System.out.println("中序遍历");
binarySortTree.infixOrder();
}
}
class BinarySortTree{
private Node root;
public void add(Node node){
if (root==null){
root=node;//如果树为空,让root指向node
}else {
root.add(node);
}
}
public void infixOrder(){
if (root!=null){
root.infixOrder();
}else {
System.out.println("二叉排序树为空不能遍历");
}
}
}
class Node{
int value;
Node left;
Node right;
public Node(int value) {
this.value = value;
}
//递归添加节点,满足二叉排序树的要求
public void add(Node node){
if (node==null){
return;
}
//判断传入节点的值和子树根节点的值
if(node.value<this.value){
//如果当前节点左子节点为空
if(this.left==null){
this.left=node;
}else {
//递归向左子树添加
this.left.add(node);
}
}else {//节点大于当前节点
if(this.right==null){
this.right=node;
}else {
//递归向右子树添加
this.right.add(node);
}
}
}
//中序遍历
public void infixOrder(){
if (this.left!=null){
this.left.infixOrder();
}
System.out.println(this.value);
if (this.right!=null){
this.right.infixOrder();
}
}
}
如图,