KY11 二叉树遍历

敲代码的小风

已于 2022-11-23 16:01:32 修改

阅读量305

点赞数

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

于 2022-11-23 15:39:18 首次发布

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

版权

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

155 篇文章 2 订阅

订阅专栏

KY11 二叉树遍历

法一:

import sys
position = 0
class TreeNode():  
    def __init__(self, data=-1):
        self.data = data
        self.leftChild = None
        self.rightChild = None
    def InOrder(self):
        if self.leftChild != None:
            self.leftChild.InOrder()
        print(self.data,end=' ')
        if self.rightChild != None:
            self.rightChild.InOrder()
    def getTree(self, line):
        self.data = line[0]
        if line[1:] == "##":
            self.leftChild = None
            self.rightChild = None
        else:
            line = line[1:]
            cntData, cntSharp = 0, 0
            for c in line:
                if c == "#":
                    cntSharp += 1
                else:
                    cntData += 1
                if cntSharp-1 == cntData:
                    break
            leftInfo, rightInfo = line[:cntSharp+cntData],line[cntSharp+cntData:]
            self.leftChild, self.rightChild = TreeNode(), TreeNode()
            if leftInfo == '#':
                self.leftChild = None
            else:
                self.leftChild.getTree(leftInfo)
            if rightInfo == "#":
                self.rightChild = None
            else:
                self.rightChild.getTree(rightInfo)
def buildTree(line): 
    global position   
    if line[position]=='#':
        position += 1
        return None
    else:
        data = line[position]
        position += 1
        root = TreeNode(data)
        root.leftChild = buildTree(line)
        root.rightChild = buildTree(line)
        return root

for line in sys.stdin:
    position = 0
    line = line.strip()
    # print("开始创建树...")
    root = buildTree(line)
    # print("完成创建树...")
    root.InOrder()

法二:

# 总节点数N=N0+N1+N2
# 总边数L=N1+2*N2
# 总边数+1=总节点数
# "#"的数量=2*N0+N1
# 推导出: "#"的数量=总结点数+1,
# 由此关系可以分出左子树部分和右子树部分

import sys
class TreeNode():  
    def __init__(self, data=-1):
        self.data = data
        self.leftChild = None
        self.rightChild = None
    def InOrder(self):
        if self.leftChild != None:
            self.leftChild.InOrder()
        print(self.data,end=' ')
        if self.rightChild != None:
            self.rightChild.InOrder()
    def getTree(self, line):
        self.data = line[0]
        if line[1:] == "##":
            self.leftChild = None
            self.rightChild = None
        else:
            line = line[1:]
            cntData, cntSharp = 0, 0
            for c in line:
                if c == "#":
                    cntSharp += 1
                else:
                    cntData += 1
                if cntSharp-1 == cntData:
                    break
            leftInfo, rightInfo = line[:cntSharp+cntData],line[cntSharp+cntData:]
            self.leftChild, self.rightChild = TreeNode(), TreeNode()
            if leftInfo == '#':
                self.leftChild = None
            else:
                self.leftChild.getTree(leftInfo)
            if rightInfo == "#":
                self.rightChild = None
            else:
                self.rightChild.getTree(rightInfo)
        
for line in sys.stdin:
    line = line.strip()
    root = TreeNode()
    # print("开始创建树...")
    root.getTree(line)  # 包括根节点在内的先序访问序列
    # print("完成创建树...")
    root.InOrder()