python深度优先搜索二叉树_Python 广度优先/深度优先遍历二叉树

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

# author: zhonghua

# filename: breadth_depth_tree.py

# create: 2016/3/31

# version: 1.0

# 广度优先/深度优先遍历二叉树

class Node:

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

self._data = data

self._left = left

self._right = right

class BinaryTree:

def __init__(self):

self._root = None

def make_tree(self, node):

self._root = node

def insert(self, node):

# 这里是建立一个完全二叉树

lst = []

def insert_node(tree_node, p, node):

if tree_node._left is None:

tree_node._left = node

lst.append(tree_node._left)

return

elif tree_node._right is None:

tree_node._right = node

lst.append(tree_node._right)

return

else:

lst.append(tree_node._left)

lst.append(tree_node._right)

if p > (len(lst) -2):

return

else:

insert_node(lst[p+1], p+1, node)

lst.append(self._root)

insert_node(self._root, 0, node)

def breadth_tree(tree):

lst = []

def traverse(node, p):

if node._left is not None:

lst.append(node._left)

if node._right is not None:

lst.append(node._right)

if p > (len(lst) -2):

return

else:

traverse(lst[p+1], p+1)

lst.append(tree._root)

traverse(tree._root, 0)

# 遍历结果就存在了lst表里

for node in lst:

print node._data

def depth_tree(tree):

lst = []

lst.append(tree._root)

while len(lst) > 0:

node = lst.pop()

print node._data

if node._right is not None:

lst.append(node._right)

if node._left is not None:

lst.append(node._left)

if __name__ == '__main__':

lst = [12, 9, 7, 19, 3, 8, 52, 106, 70, 29, 20, 16, 8, 50, 22, 19]

tree = BinaryTree()

# 生成完全二叉树

for (i, j) in enumerate(lst):

node = Node(j, None, None)

if i == 0:

tree.make_tree(node)

else:

tree.insert(node)

# 广度优先遍历

breadth_tree(tree)

# 深度优先遍历

depth_tree(tree)