Leetcode两颗二叉树中的所有元素

最新推荐文章于 2024-05-20 21:56:33 发布

梦想闹钟

最新推荐文章于 2024-05-20 21:56:33 发布

阅读量28

点赞数

分类专栏： Leetcode中等题文章标签： leetcode 算法 python

本文链接：https://blog.csdn.net/qq_43199509/article/details/130014201

版权

Leetcode中等题专栏收录该内容

43 篇文章 0 订阅

订阅专栏

在这里插入图片描述
我的解法：
通过python自带的SortedList来解决排序问题

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def getAllElements(self, root1: TreeNode, root2: TreeNode) -> List[int]:
        from sortedcontainers import SortedList
        result=SortedList()
        if root1:
         last_list=[root1]
         while(last_list):
            node_list=[] 
            for each_node in last_list:
                result.add(each_node.val)
                if each_node.left is not None:
                   node_list.append(each_node.left)
                if each_node.right is not None:
                   node_list.append(each_node.right)
            last_list=node_list   
        if root2:
         last_list=[root2]    
         while(last_list):
            node_list=[] 
            for each_node in last_list:
                result.add(each_node.val)
                if each_node.left is not None:
                   node_list.append(each_node.left)
                if each_node.right is not None:
                   node_list.append(each_node.right)
            last_list=node_list   
        return result

标准解法：
遍历树之后，添加所有元素后再做一次总排序

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def getAllElements(self, root1: TreeNode, root2: TreeNode) -> List[int]:
        ret=[]
        def midorder(root,ret):

            if root:
                midorder(root.left,ret)
                ret.append(root.val)
                midorder(root.right,ret)
        midorder(root1,ret)
        midorder(root2,ret)
        ret.sort()
        return ret