python 生成满二叉树并进行深度优先搜索和宽度优先搜索

最新推荐文章于 2024-04-11 19:43:44 发布

原创最新推荐文章于 2024-04-11 19:43:44 发布 · 808 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#二叉树 #深度优先搜索 #宽度优先搜索

python 同时被 2 个专栏收录

76 篇文章

订阅专栏

python 语法知识点收集

59 篇文章

订阅专栏

本文介绍了一种构建固定深度二叉树的方法，并实现了深度优先与宽度优先两种遍历方式，通过具体代码展示了节点的生成及遍历过程。

# -*- coding: UTF-8 -*-



from __future__ import print_function
deep = 3

#二叉树*******************************start

L = []
LW = []
class TreeNode(object):
    def __init__(self,data,left,right):
        self.data = data
        self.left = left
        self.right = right



def add_tree_node(tn,count=1):
    _deep = tn.data['deep']
    if  _deep < deep:
        #右子孙
        # print(_deep)
        temp = TreeNode({'deep':_deep+1,'node_num':count+1}, None, None)
        tn.right = temp
        print(tn.data['node_num'])
        count = add_tree_node(temp,count+1)
        #左子孙
        temp = TreeNode({'deep':_deep+1,'node_num':count+1},None,None)
        tn.left = temp
        print(tn.data['node_num'])
        count = add_tree_node(temp,count+1)
    return count

stack = []


def deep_travel_tree(tn):
    #读取当前节点并压入栈
    L.append(tn.data['node_num'])
    if tn.right != None:
        deep_travel_tree(tn.right)
    if tn.left != None:
        deep_travel_tree(tn.left)
    return


def width_travel_tree(tn):
    #压入节点
    LW.append(tn.data['node_num'])
    if tn.right != None and tn.left != None:
        stack.append(tn.right)
        stack.append(tn.left)
    if len(stack)!=0:
        temp = stack.pop(0)
        width_travel_tree(temp)
    return



def main():
    root =  TreeNode({'deep':1,'node_num':1},None,None)
    add_tree_node(root)
    deep_travel_tree(root)
    width_travel_tree(root)
    print(L)
    print(LW)

main()