python 二叉树遍历非递归_python数据结构之二叉树的遍历实例

# -*- coding: utf - 8 - *-

class TreeNode(object):

def __init__(self, left=0, right=0, data=0):

self.left = left

self.right = right

self.data = data

class BTree(object):

def __init__(self, root=0):

self.root = root

def is_empty(self):

if self.root is 0:

return True

else:

return False

def preorder(self, treenode):

'前序(pre-order，NLR)遍历'

if treenode is 0:

return

print treenode.data

self.preorder(treenode.left)

self.preorder(treenode.right)

def inorder(self, treenode):

'中序(in-order，LNR'

if treenode is 0:

return

self.inorder(treenode.left)

print treenode.data

self.inorder(treenode.right)

def postorder(self, treenode):

'后序(post-order&#x