二叉树模型代码

package test;


public class tree2 {
private int data;
private tree2 lChild;
private tree2 rChild;

public int getNodes){
return this.lChild == null ? 0 :
this.lChild.getNodes ) )
+ this.rChild == null
? 0 : this.rChild.getNodes ) ) + 1;
}
public int sum){
return this.lChild == null ? 0 :
this.lChild.sum ) )
+ this.rChild == null ? 0 :
this.rChild.sum ) ) + this.data;
}

public void fTraverse ) {
System.out.print this.data+" " );
if this.lChild != null ) {
this.lChild.fTraverse );
}
if this.rChild != null ) {
this.rChild.fTraverse );
}
}
public void mTraverse ) {
if this.lChild != null ) {
this.lChild.mTraverse );
}
System.out.print this.data+" " );
if this.rChild != null ) {
this.rChild.mTraverse );
}
}
public void lTraverse ) {
if this.lChild != null ) {
this.lChild.lTraverse );
}
if this.rChild != null ) {
this.rChild.lTraverse );
}
System.out.print this.data+" " );
}

public void addNodetree2 node ) {
if node.data< this.data ) {
if this.lChild == null ) {
this.lChild = node;
} else {
this.lChild.addNode node );
}
}else ifnode.data> this.data){
if this.rChild == null ) {
this.rChild = node;
} else {
this.rChild.addNode node );
}
}

}
public tree2int data) {
this.data = data;
}

public int getData) {
return data;
}

public void setDataint data) {
this.data = data;
}

public tree2 getlChild) {
return lChild;
}

public void setlChildtree2 lChild) {
this.lChild = lChild;
}

public tree2 getrChild) {
return rChild;
}

public void setrChildtree2 rChild) {
this.rChild = rChild;
}
}

  

Published by

风君子

独自遨游何稽首 揭天掀地慰生平

发表回复

您的电子邮箱地址不会被公开。 必填项已用 * 标注