二叉树排序

package net.com.tree;

public class BinaryTree {
public static void main(String[] args){

BinaryTree binaryTree=new BinaryTree();
int[]array={8,3,10,9,1,5};
TreeNode treeNode=binaryTree.bulidSortTree(array);
binaryTree.printTreeInorder(treeNode);
}
public void createTree(TreeNode treeNode,int[] array){
for(int i=1;i<array.length;i++){
bulidTreeSty(treeNode,array[i]);
}
}

public TreeNode bulidSortTree(int[] array){
TreeNode treeNode=new TreeNode(array[0]);
createTree(treeNode, array);
return treeNode;
}
private void bulidTreeSty(TreeNode treeNode,int data){
if(data<=treeNode.data){
if(treeNode.left==null){
treeNode.setLeft(new TreeNode(data));
}else{
bulidTreeSty(treeNode.getLeft(), data);
}
}else{
if(treeNode.right==null){
treeNode.setRight(new TreeNode(data));
}else{
bulidTreeSty(treeNode.getRight(), data);
}
}
}
public void printTreeInorder(TreeNode treeNode){//中序遍历二叉树
if(treeNode!=null){
printTreeInorder(treeNode.left);
System.out.println(treeNode.data);
printTreeInorder(treeNode.right);
}

}
}

class TreeNode{
TreeNode left;//左子树
TreeNode right;//右子树
int data;

public TreeNode(){
this.left=null;
this.right=null;
this.data=0;
}

public TreeNode(int data){
this.left=null;
this.right=null;
this.data=data;
}

public TreeNode getLeft() {
return left;
}
public void setLeft(TreeNode left) {
this.left = left;
}

public TreeNode getRight() {
return right;
}
public void setRight(TreeNode right) {
this.right = right;
}

public int getData() {
return data;
}
public void setData(int data) {
this.data = data;
}

}