算法题/创建二叉树

最新推荐文章于 2023-01-11 17:46:20 发布

szj_jojo

最新推荐文章于 2023-01-11 17:46:20 发布

阅读量258

点赞数

分类专栏：面试算法题文章标签： python tree

本文链接：https://blog.csdn.net/szj_huhu/article/details/77497168

版权

面试算法题专栏收录该内容

47 篇文章 0 订阅

订阅专栏

python2.7

创建二叉树：
这里写图片描述

#coding:utf-8

#创建二叉树节点
class Node(object):
    def __init__(self,data,left,right):
        self.data = data
        self.left = left
        self.right = right

#创建二叉树
class Tree(object):
    #创建一棵树,默认一个根节点
    def __init__(self,data):
        self.root = Node(data, None, None)
        self.size = 1

if __name__ == '__main__':
    #创建二叉树
    print('create tree')
    tree = Tree(1)
    tree.root.left = Node(2,None,None)
    tree.root.right = Node(3,None,None)
    tree.root.left.left = Node(4,None,None)
    tree.root.left.right = Node(5,None,None)
    tree.root.right.left = Node(6,None,None)
    tree.root.right.right = Node(7,None,None)
    tree.root.left.left.left = Node(8,None,None)
    tree.root.left.right.right = Node(9,None,None)
    tree.root.right.left.right = Node(10,None,None)
    tree.root.right.right.left = Node(11,None,None)
    tree.root.right.right.right = Node(12,None,None)

    print('tree.root.data:',tree.root.data)
    print('tree.root.left.data:',tree.root.left.data)
    print('tree.root.left.left.data:',tree.root.left.left.data)
    print('tree.root.right.right.right.data',tree.root.right.right.right.data)