@[TOC]python二叉树遍历
Class Tree:
def __init__(self,data):
self.data = data
self.lchild = None
self.rchild = None
# 先序遍历
def pre_read(self, root):
if not root:
return
print(root)
self.pre_read(root.lchild)
self.pre_read(root.rchild)
# 中序遍历
def mid_read(self,root):
if not root:
return
self.mid_read(root.lchild)
print(root)
self.mid_read(root.rchild)
# 后序遍历
def back_read(self,root):
if not root:
return
self.back_read(root.lchild)
self.back_read(root.rchild)
print(root)