java二叉樹的遍歷(遞歸和非遞歸)

1、imptjava.util.StackpublicclassMyTreepublicstaticvoidmain(String[]s)newMyTree()publicMyTree()TreeNoderoot=init()初始化二叉樹并返回根節(jié)點(diǎn)System.out.println(“遞歸先序遍歷“)preder(root)System.out.println()System.out.println(“遞歸中序遍歷“)inder(roo

2、t)System.out.println()System.out.println(“遞歸后續(xù)遍歷“)posder(root)System.out.println()System.out.println(“非遞歸先序遍歷“)preder(root)System.out.println()System.out.println(“非遞歸中序遍歷“)_inder(root)System.out.println()System.out.print

3、ln(“非遞歸后續(xù)遍歷“)_posder(root)System.out.println()publicvoidpreder(TreeNoderoot)遞歸二叉樹的前序遍歷if(root!=null)System.out.print(root.getValue())訪問節(jié)點(diǎn)值preder(root.getLeft())preder(root.getRight())publicvoid_preder(TreeNoderoot)非遞歸二叉樹

4、的前序遍歷Stackstack=newStack()定義堆棧存儲(chǔ)while(!(root==null訪問節(jié)點(diǎn)if(root!=null)找到當(dāng)前節(jié)點(diǎn)最深的左子樹stack.push(root)將當(dāng)前左子樹入棧root=root.getLeft()else當(dāng)左子樹到底時(shí)，開始訪問右節(jié)點(diǎn)root=stack.pop()當(dāng)前節(jié)點(diǎn)出棧root=root.getRight()指向右子樹stack.push(root)stack.push(2)ro

5、ot=root.getRight()將節(jié)點(diǎn)指向右子樹并開始訪問指向右子樹的左子樹breakelseif(sign==2)當(dāng)?shù)诙纬鰲r(shí)訪問節(jié)點(diǎn)System.out.print(root.getValue())root=nullpublicTreeNodeinit()二叉樹的初始化TreeNodee=newTreeNode(E)葉子節(jié)點(diǎn)TreeNodef=newTreeNode(F)TreeNoded=newTreeNode(Def)帶有

6、左右子樹的節(jié)點(diǎn)TreeNodec=newTreeNode(C)TreeNodeb=newTreeNode(Bcd)TreeNodej=newTreeNode(J)TreeNodeh=newTreeNode(Hnullj)帶有右子樹的節(jié)點(diǎn)TreeNodei=newTreeNode(I)TreeNodeg=newTreeNode(Ghi)TreeNodea=newTreeNode(Abg)returna建立二叉樹的節(jié)點(diǎn)類classTreeN

7、odepublicdatapublicTreeNodeleftrightpublicTreeNode(data)this(datanullnull)publicTreeNode(dataTreeNodeleftTreeNoderight)this.data=datathis.left=leftthis.right=rightpublicTreeNodegetLeft()返回左子樹returnleftpublicTreeNodegetRi