1.二叉排序树介绍
2.二叉排序树创建和遍历
创建二叉排序树思路:
遍历:采用中序遍历
public class BinarySortTreeDemo {
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]));
}
//中序遍历二叉排序树
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){//如果当前左子节点为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);
if(this.right!=null){
this.right.infixOrder();
}
}
@Override
public String toString() {
return "Node{" +
"value=" + value +
'}';
}
}