二叉树的创建和遍历代码,Python代码库,德仔网

代码语言

代码分类

【Python】二叉树的创建和遍历

作者:sgcha / 发布于2015/5/11/ 809

用python创建二叉树，并完成先序，中序，后序的遍历。
做这个的目的：
1.是为了复习一下二叉树的知识
2.是为了学习python
3.有什么不足之处希望各位多多指教


	#coding:utf-8
	#author:Elvis
	
	class TreeNode(object):
	 def __init__(self):
	 self.data = '#'
	 self.l_child = None
	 self.r_child = None
	
	class Tree(TreeNode):
	 #create a tree
	 def create_tree(self, tree):
	 data = raw_input('->')
	 if data == '#':
	 tree = None
	 else:
	 tree.data = data
	 tree.l_child = TreeNode()
	 self.create_tree(tree.l_child)
	 tree.r_child = TreeNode()
	 self.create_tree(tree.r_child)
	
	 #visit a tree node
	 def visit(self, tree):
	 #输入#号代表空树
	 if tree.data is not '#':
	 print str(tree.data) + '\t',
	 #先序遍历
	 def pre_order(self, tree):
	 if tree is not None:
	 self.visit(tree)
	 self.pre_order(tree.l_child)
	 self.pre_order(tree.r_child)
	
	 #中序遍历
	 def in_order(self, tree):
	 if tree is not None:
	 self.in_order(tree.l_child)
	 self.visit(tree)
	 self.in_order(tree.r_child)
	
	 #后序遍历
	 def post_order(self, tree):
	 if tree is not None:
	 self.post_order(tree.l_child)
	 self.post_order(tree.r_child)
	 self.visit(tree)
	
	t = TreeNode()
	tree = Tree()
	tree.create_tree(t)
	tree.pre_order(t)
	print '\n'
	tree.in_order(t)
	print '\n'
	tree.post_order(t)

试试其它关键字

　二叉树　

同语言下

可能有用的

sgcha贡献的其它代码(3)