代码随想录Day20|二叉树6_3|二叉搜索树_2

最新推荐文章于 2024-09-17 23:15:58 发布

OctoberTE

最新推荐文章于 2024-09-17 23:15:58 发布

阅读量67

点赞数

分类专栏：力扣刷题文章标签： python 开发语言

本文链接：https://blog.csdn.net/qq_43250021/article/details/132011260

版权

力扣刷题专栏收录该内容

36 篇文章 0 订阅

订阅专栏

236. 二叉树的最近公共祖先

暂时理解了代码，背着写出来了，还需要复习

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        if not root:
            return None
        if root==q or root==p:
            return root
        left = self.lowestCommonAncestor(root.left,p,q)
        right = self.lowestCommonAncestor(root.right,p,q)

        if not left and right:
            return right
        elif not right and left:
            return left
        elif left and right:
            return root

235. 二叉搜索树的最近公共祖先

比上题简单，根据二叉搜索树的

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        if not root:
            return None
        if root.val>p.val and root.val>q.val:
            return self.lowestCommonAncestor(root.left,p,q)
        elif root.val<p.val and root.val<q.val:
            return self.lowestCommonAncestor(root.right,p,q)
        else:
            return root

701.二叉搜索树中的插入操作

迭代比较容易想出来，递归看了答案代码写的

## 迭代
class Solution:
    def insertIntoBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:
        if not root:
            return TreeNode(val)
        pre = root
        newnode = TreeNode(val)
        cur = root.left if val<root.val else root.right
        while(cur):
            pre = cur
            if cur.val>val:
                cur = cur.left
            else:
                cur = cur.right
        if pre.val>val:
            pre.left = newnode
        else:
            pre.right = newnode
        return root

## 递归
class Solution:
    def insertIntoBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:
        if not root:
            return TreeNode(val)
        if val > root.val:
            root.right = self.insertIntoBST(root.right,val)
        else:
            root.left = self.insertIntoBST(root.left,val)
            
        return root