KY207 二叉排序树

最新推荐文章于 2024-08-19 11:12:00 发布

敲代码的小风

最新推荐文章于 2024-08-19 11:12:00 发布

阅读量103

点赞数

分类专栏：牛客网-计算机考研上机复试文章标签：算法 python

本文链接：https://blog.csdn.net/m0_46653437/article/details/128167176

版权

牛客网-计算机考研上机复试专栏收录该内容

155 篇文章 2 订阅

订阅专栏

KY207 二叉排序树

import sys
class TreeNode():
    def __init__(self, data=-1):
        self.data = data
        self.leftChild, self.rightChild = None, None
    def insert(self, data):
        prior = self
        while True:
            if prior.data >= data:
                if prior.leftChild == None:
                    prior.leftChild = TreeNode(data)
                    print(prior.data)
                    break
                prior = prior.leftChild
            else:
                if prior.rightChild == None:
                    prior.rightChild = TreeNode(data)
                    print(prior.data)
                    break
                prior = prior.rightChild

newCase = True
for line in sys.stdin:
    line = line.strip()
    if newCase:
        N  = int(line)
        newCase = False
    else:
        newCase = True
        nums = list(map(int,line.split()))
        root = TreeNode()
        for num in nums:
            root.insert(num)