zoukankan      html  css  js  c++  java
  • Binary Search Tree 以及一道 LeetCode 题目

    一道LeetCode题目

    今天刷一道LeetCode的题目,要求是这样的:

    Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change the root of the tree, so the result should return the new root of the trimmed binary search tree.

    由于对于 Binary search tree 不理解,所以绕了点弯路,要解这道题,必须理解什么是 binary search tree。我们来看一下定义:

    A binary search tree is a rooted binary tree, whose internal nodes each store a key (and optionally, an associated value) and each have two distinguished sub-trees, commonly denoted left and right. The tree additionally satisfies the binary search property, which states that the key in each node must be greater than or equal to any key stored in the left sub-tree, and less than or equal to any key stored in the right sub-tree.[1]:287 (The leaves (final nodes) of the tree contain no key and have no structure to distinguish them from one another.

    看一下下面这个图一下子就能理解,就是说每个节点左边的值一定小于右边。

    了解到这个约束,这个题目解起来就比较简单了:

    class Solution:
        def trimBST(self, root, L, R):
            """
            :type root: TreeNode
            :type L: int
            :type R: int
            :rtype: TreeNode
            """
            if(root.val < L):
                if(root.right != None):
                    root = self.trimBST(root.right, L, R)
                else:
                    return None
            elif(root.val > R):
                if(root.left != None):
                    root = self.trimBST(root.left, L, R)
                else:
                    return None
            else:
                if(root.left != None):
                    root.left = self.trimBST(root.left, L, R)
                else:
                    root.left = None
                    
                if(root.right != None):   
                    root.right = self.trimBST(root.right, L, R)
                else:
                    root.right = None
                    
            return root
    

    BST数据结构的一些算法特性

    Algorithm Average Worst case
    Space O(n) O(n)
    Search O(log n) O(n)
    Insert O(log n) O(n)
    Delete O(log n) O(n)

    参考资料:
    1、Leetcode
    2、Wiki Binary search tree

  • 相关阅读:
    2018年6月2号(线段树(2))
    [朋友(dalao)们的友链](¦3[▓▓]让我安详的躺一会儿...
    Hello,World
    算法笔记:数论基础
    [单源最短路]逃离僵尸岛
    算法笔记:最小生成树
    算法笔记:单调队列
    算法笔记:高斯消元
    [博客..配置?]博客园美化
    [大模拟]LuoGu P2033 Chessboard Dance
  • 原文地址:https://www.cnblogs.com/cocowool/p/8527225.html
Copyright © 2011-2022 走看看