二叉排序树又称二叉查找树。它或者是一颗空树,或者是具有下列性质的二叉树:
1>如果左子树不空,那么左子树上的所有结点的值均小于它的根结点的值;
2>如果右子树不空,那么右子树上的所有结点的值均大于它的根结点的值;
3>左、右子树也分别为二叉排序树。
实现代码如下:
import java.util.LinkedList;
import java.util.Queue;
/**
* @author lilin
*性质:
*1.如果左子树不空,那么左子树上所有节点的值均小于它的根节点的值
*2.如果右子树不空,那么右子树上所有节点的值均大于它的根节点的值
*左右子树也分别为二叉查找树
**/
class Node{
public int data;
public Node left;
public Node right;
public Node(int data){
this.data = data;
this.left = null;
this.right = null;
}
}
public class BinaryTree {
private Node root;
public BinaryTree(){
root = null;
}
//将data插入到查找二叉树中
public void insert(int data){
Node newNode = new Node(data);
if(root == null){
root = newNode;
}else{
Node current = root;
Node parent;
while(true){//存着插入的位置
parent = current;
if(data<current.data){
current = current.left;
if(current == null){
parent.left = newNode;
return;
}
}else{
current = current.right;
if(current == null){
parent.right = newNode;
return;
}
}
}
}
}
//将数值输入构建二叉树
public void buildTree(int[] data){
for(int i=0;i<data.length;i++){
insert(data[i]);
}
}
//中序遍历方法递归实现
public void inOrder(Node localRoot){
if(localRoot != null){
inOrder(localRoot.left);
System.out.print(localRoot.data+" ");
inOrder(localRoot.right);
}
}
public void inOrder(){
this.inOrder(this.root);
}
//先序遍历方法递归实现
public void preOrder(Node localRoot){
if(localRoot != null){
System.out.print(localRoot.data+" ");
preOrder(localRoot.left);
preOrder(localRoot.right);
}
}
public void preOrder(){
this.preOrder(this.root);
}
//后序遍历方法递归实现
public void postOrder(Node localRoot){
if(localRoot != null){
postOrder(localRoot.left);
postOrder(localRoot.right);
System.out.print(localRoot.data+" ");
}
}
public void postOrder(){
this.postOrder(this.root);
}
//层序遍历二叉树
public void layerTranverse(){
if(this.root == null){
return;
}
Queue<Node> q = new LinkedList<Node>();
q.add(this.root);
while(!q.isEmpty()){
Node n = q.poll();
System.out.print(n.data);
System.out.print(" ");
if(n.left != null){
q.add(n.left);
}
if(n.right != null){
q.add(n.right);
}
}
}
public static void main(String[] args) {
BinaryTree biTree = new BinaryTree();
int[] data = {2,8,7,4,9,3,1,6,7,5};
biTree.buildTree(data);
System.out.print("二叉树的中序遍历:");
biTree.inOrder();System.out.println();
System.out.print("二叉树的先序遍历:");
biTree.postOrder();System.out.println();
System.out.print("二叉树的后序遍历:");
biTree.postOrder();System.out.println();
}
}