python二叉树
二叉树的建立:
# -*- coding : utf-8 -*-
class Node:
def __init__(self,value=None,left=None,right=None):
self.value = value
self.left = left
self.right = right
if __name__ =='__main__':
root = Node('A',Node('B',Node('C')),Node('D',Node('E','F')))
生成的二叉树为
二叉树的遍历:
前向遍历
def PreTraverse(root):
if root ==None:
return
print(root.value)
PreTraverse(root.left)
PreTraverse(root.right)
执行结果: