Skip to content

Latest commit

 

History

History
62 lines (47 loc) · 1.64 KB

_776. Split BST.md

File metadata and controls

62 lines (47 loc) · 1.64 KB
Raw

776. Split BST

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

First completed : June 29, 2024

Last updated : July 04, 2024

Related Topics : Tree, Binary Search Tree, Recursion, Binary Tree

Acceptance Rate : 82.53 %

If greater than root, root is part of output (indx 0) and we need to find first 
value greater than that for other node

If less than root, root is part of output (indx 1) and we have to find
smaller values go left

Solutions

Python

m776 Weekly Premium.py

# 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 splitBST(self, root: Optional[TreeNode], target: int) -> List[Optional[TreeNode]]:
        if not root :
            return [None, None]

        if root.val == target :
            temp = root.right
            root.right = None
            return [root, temp]

        if root.val > target :
            temp = self.splitBST(root.left, target)
            root.left = temp[1]
            return [temp[0], root]

        temp = self.splitBST(root.right, target)
        root.right = temp[0]
        return [root, temp[1]]