package d11二叉树的基本操作;
public class Node {
public long date;
public String sData;
public Node leftChild;
public Node rightChild;
public Node (long value ,String sData){
this .date=value ;
this .sData=sData;
}
}
package d11二叉树的基本操作;
public class Tree {
public Node root;
public void insert (long value ,String aValue){
Node newNode =new Node(value ,aValue);
Node current = root;
Node parent;
if (root==null ){
root=newNode;
return ;
}else {
while (true ){
parent = current;
if (current.date>value ){
current = current.leftChild;
if (current==null ){
parent.leftChild=newNode;
return ;
}
}else {
current = current.rightChild;
if (current==null ){
parent.rightChild=newNode;
return ;
}
}
}
}
}
public Node find (long value ){
Node current = root;
while (current.date>value ){
if (current.date>value ){
current = current.leftChild;
}else {
current=current.rightChild;
}
if (current==null ){
return null ;
}
}
return current;
}
public void delete (){
}
}