二叉树的增删改查

首先建立Node

public class Node<T extends Comparable<T>> {
  private T date;
  private int index;
  private Node<T> lchile;
  private Node<T> rchile;
  
  public Node(){
	  
  }
  public Node(T date) {
	  this.date =date;
  }
  public Node(T date,Node<T> lNode,Node<T> rNode) {
    this.date =date;
    this.lchile =lNode;
    this.rchile =rNode;
  }
  
  
public T getDate() {
	return date;
}
public void setDate(T date) {
	this.date = date;
}
public int getIndex() {
	return index;
}
public void setIndex(int index) {
	this.index = index;
}
public Node<T> getLchile() {
	return lchile;
}
public void setLchile(Node<T> lchile) {
	this.lchile = lchile;
}
public Node<T> getrNode() {
	return rchile;
}
public void setrNode(Node<T> rchile) {
	this.rchile = rchile;
}
@Override
public String toString() {
	return "Node [date=" + date + ", index=" + index &#