二叉树实现java,二叉树实现java
public class Node {
private int value;
private Node left;
private Node right;
//存儲(chǔ)二叉樹(shù)
public void store(int value){
if(value < this.value){//在該結(jié)點(diǎn)的左邊
if(left==null){//該結(jié)點(diǎn)的左結(jié)點(diǎn)為空
left = new Node();left.value = value;//新建它的左結(jié)點(diǎn)
}else{//如果不為空則將左結(jié)點(diǎn)當(dāng)作當(dāng)前節(jié)點(diǎn)繼續(xù)判斷
left.store(value);
}
}else if(value > this.value){
if(right == null){
right = new Node();right.value = value;
}else{
right.store(value);
}
}
}
//查找二叉樹(shù)
public boolean find(int value){
System.out.println("happen: "+this.value);//顯示當(dāng)前結(jié)點(diǎn)的值
if(this.value == value)return true;
else if(value < this.value){//搜索的值小于當(dāng)前值
if(left==null)return false;
return left.find(value);
}else{
if(right==null)return false;
return right.find(value);
}
}
//前序歷遍
public void preList(){
System.out.print(this.value+",");
if(left!=null)left.preList();
if(right!=null)right.preList();
}
//中序歷遍
public void midList(){
if(left!=null)left.midList();
System.out.print(this.value+",");
if(right!=null)right.midList();
}
//后序歷遍
public void afterList(){
if(left!=null)left.afterList();
if(right!=null)right.afterList();
System.out.print(this.value+",");
}
總結(jié)
以上是生活随笔為你收集整理的二叉树实现java,二叉树实现java的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。
- 上一篇： 安装好了java7怎么打开,Window
- 下一篇： java什么是稳定排序,这可能是你听说过