二叉树

public class MyBinaryTree {
private MyNode root;
private MyBinaryTree left;
private MyBinaryTree right;

public void addData(int n){
if(root==null){
root = new MyNode();
root.setData(n);
}else{
int data = root.getData();
if(n<=data){
if(this.left==null)
this.left = new MyBinaryTree();
this.left.addData(n);
}else{
if(this.right==null)
this.right = new MyBinaryTree();
this.right.addData(n);
}
}
}
/**
* xian
* */
public void preorder(){
if(this.root!=null)
System.out.print(root.getData()+",");
if(this.left!=null)
this.left.preorder();
if(this.right!=null)
this.right.preorder();
}
/**
* zhong
* */
public void inorder(){
if(this.left!=null)
this.left.inorder();
if(this.root!=null)
System.out.print(root.getData()+",");
if(this.right!=null)
this.right.inorder();
}
/**
* hou
* */
public void postorder(){
if(this.left!=null)
this.left.postorder();
if(this.right!=null)
this.right.postorder();
if(this.root!=null)
System.out.print(root.getData()+",");
}


public static void main(String[] args) {
int[] arr = {2, 8, 7, 4 ,9,3,1,6,7,5};
MyBinaryTree bt = new MyBinaryTree();
for(int i=0;i<arr.length;i++){
bt.addData(arr[i]);
}
System.out.println("xian：");
bt.preorder();
System.out.println("\nzhong：");
bt.inorder();
System.out.println("\nhou：");
bt.postorder();
}

}

class MyNode {
private int data;

public int getData() {
return data;
}

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

}