學(xué)生作品-二叉排序樹的插入和查找操作說明

1、一、作品要編寫二叉排序樹和查找操作問題程序二、學(xué)生作品分1、代碼分publicclassprotectedBinaryNoderoot; public BinarySortTree()一、作品要編寫二叉排序樹和查找操作問題程序二、學(xué)生作品分1、代碼分publicclassprotectedBinaryNoderoot; public BinarySortTree()/returnpublicvoid/(n中根次序遍歷二叉排序樹： ); if (root!=null)private void inOrder(BinaryNode /pif(p.data+public BinaryNode sea

2、rch(E /value/if(value=null|!(valueinstanceofComparable) return null;Comparablecmpobj=BinaryNodewhile(p!=null/(p.data+?/value/if/returninsert(E /if (value=null | !(value instanceof Comparable) /不while(p!=null/(p.data+?/value/if/returninsert(E /if (value=null | !(value instanceof Comparable) /不空對象或不可r

3、eturnfalse; if (root=null)root=newBinaryNode(value); return true;returninsert(value,valuerootinsert(Evalue,BinaryNode/p/Comparablecmpobj=ifreturn/ifif (p.left=null)p.left = new /preturnreturninsert(value,/pifp.right=new/preturnreturninsert(value,/ppublicEremove(Ep.right=new/preturnreturninsert(value

4、,/ppublicEremove(E/if(root=null|value=null|!(valueinstanceofreturnreturnremove(value,root,/rootprivateEremove(Evalue,BinaryNodep,BinaryNode/Comparablecmpobj=(Comparable)value; if (p!=null)/parent p ifreturnremove(value,p.left,ifreturnremove(value,p.right,/pif(p.left!=null&/p2/尋找pwhile (innext.left!=

5、null) innext=innext.left;p.data=returnremove(p.data, p.right, /p1點(diǎn)if 刪除根結(jié)點(diǎn)，即ifroot=root=p.right; return p.data;/pif (p=parent.left) ifparent.left=parent.left=/pparent/p/pif 刪除根結(jié)點(diǎn)，即ifroot=root=p.right; return p.data;/pif (p=parent.left) ifparent.left=parent.left=/pparent/p/p parent ifparent.right=par

6、ent.right=p.right; return p.data;returnpublicicvoidmain(Stringegerbstree=new： for i=0;ikey.length;if /功(keyi+egerelement= )+element=ln(查找+element+,bstree.search(element)!=null?:)+刪publicBinaryNodesearchNode(E/valueif(value=null|刪publicBinaryNodesearchNode(E/valueif(value=null|!(valueinstanceofCompar

7、able) return null;returnsearchNode(value,private BinaryNode searchNode(E value, BinaryNode p) / 查找值為valueifComparablecmpobj=if功return(p.data+?ifreturnsearchNode(value,/returnsearchNode(value,/returninsertNode(Eif(value=null|!(valueinstanceofreturnifroot=new Comparablecmpobj=whileparent=p; if (return/ifp=new/parent.left=/pparentparent.right=/pwhileparent=p; if (return/ifp=new/parent.left=/pparentparent.right=/pparentreturn三、作品操作說：54 1866 87 3612 中根次序遍歷二叉排序樹61215 1