二叉树模型

最新推荐文章于 2024-08-21 11:14:17 发布

fengweicun

最新推荐文章于 2024-08-21 11:14:17 发布

阅读量280

点赞数

文章标签： python 算法

本文链接：https://blog.csdn.net/fengweicun/article/details/127200614

版权


class TreeNode:

    def __init__(self,name) -> None:

        self._name=name
        self._left_node=None
        self._right_node=None
        

class Tree:
    root=None
    nodes=[]
    def add_node(self,name,index):

        node=TreeNode(name)
        if Tree.root is None:
            Tree.root=node
            Tree.nodes.append(node)
        else:
            if index%2==1:
                tmp_node=Tree.nodes[index-1]
            elif index%2==0:
                tmp_node=Tree.nodes[index-2]
            
            if tmp_node._left_node is None:
                tmp_node._left_node=node
                Tree.nodes.append(tmp_node._left_node)
            elif tmp_node._right_node is None:
                tmp_node._right_node=node
                Tree.nodes.append(tmp_node._right_node)
        

if __name__=="__main__":

    tree=Tree()
    all_node=["Root","Node1","Node2","Node3","Node4","Node5","Node6","Node7","Node8","Node9","Node10"]
    total=len(all_node)
    for i ,val in enumerate(all_node):
        tree.add_node(val,i)

    print(tree.nodes)
    print(tree.root)

    pass