#encoding=utf-8class Tree():def __init__(self,leftjd=0,rightjd=0,data=0):self.leftjd = leftjdself.rightjd = rightjdself.data = data class Btree():def __init__(self,base=0):self.base = base#前序遍歷 根左右def qout(self,jd):if jd == 0:returnprint jd.dataself.qout(jd.leftjd)self.qout(jd.rightjd)#中序遍歷 左根右def mout(self,jd):if jd == 0:returnself.mout(jd.leftjd)print jd.dataself.mout(jd.rightjd)#后序遍歷 左右根def hout(self,jd):if jd == 0:returnself.hout(jd.leftjd)self.hout(jd.rightjd)print jd.datajd1 = Tree(data=8) jd2 = Tree(data=9) base = Tree(jd1,jd2,7) x = Btree(base) x.qout(x.base) print '\r\n' x.mout(x.base) print '\r\n' x.hout(x.base)

?

轉載于:https://www.cnblogs.com/gide/p/5235166.html

總結

以上是生活随笔為你收集整理的python先序、中序、后序排序的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。