zoukankan      html  css  js  c++  java
  • Leetcode: Split BST

    Given a Binary Search Tree (BST) with root node root, and a target value V, split the tree into two subtrees where one subtree has nodes that are all smaller or equal to the target value, while the other subtree has all nodes that are greater than the target value.  It's not necessarily the case that the tree contains a node with value V.
    
    Additionally, most of the structure of the original tree should remain.  Formally, for any child C with parent P in the original tree, if they are both in the same subtree after the split, then node C should still have the parent P.
    
    You should output the root TreeNode of both subtrees after splitting, in any order.
    
    Example 1:
    Input: root = [4,2,6,1,3,5,7], V = 2
    Output: [[2,1],[4,3,6,null,null,5,7]]
    Explanation:
    Note that root, output[0], and output[1] are TreeNode objects, not arrays.
    
    The given tree [4,2,6,1,3,5,7] is represented by the following diagram:
    
              4
            /   
          2      6
         /     / 
        1   3  5   7
    
    while the diagrams for the outputs are:
    
              4
            /   
          3      6      and    2
                /            /
               5   7         1
    

    Note:

    1. The size of the BST will not exceed 50.
    2. The BST is always valid and each node's value is different.
     

    Recursion:

    The hard part is how to find recurion logic

    Let res[0] be tree less than or equal to V, res[1] be tree greater than V.

    Detailed explanation: First of all, we can see that the given root is always there in the answer (either in the bigger subtree or in the smaller subtree). After that, if root->val > V, there is a chance that there is some subtree within the subtree root->left which maybe greater than V and that subtree needs to be attached to root->left. Now, we see that this problem of spliting the "subtree in root->left using V" is the same as the current problem of splitting root. So we can recurse on left and get the required results. One thing to worry about is, what if there is no subtree in root->left that is greater than V? This case is handled automatically by the base case.
    Similar argument applies for the case root->val <= V.

     1 /**
     2  * Definition for a binary tree node.
     3  * public class TreeNode {
     4  *     int val;
     5  *     TreeNode left;
     6  *     TreeNode right;
     7  *     TreeNode(int x) { val = x; }
     8  * }
     9  */
    10 class Solution {
    11     public TreeNode[] splitBST(TreeNode root, int V) {
    12         // res[0] is the root of tree <= V, and vise versa for res[1] 
    13         TreeNode[] res = new TreeNode[2]; 
    14         if (root == null) return res;
    15         
    16         if (root.val > V) {
    17             res[1] = root;
    18             TreeNode[] leftSide = splitBST(root.left, V);
    19             root.left = leftSide[1];
    20             res[0] = leftSide[0];
    21         }
    22         else { // root.val <= V
    23             res[0] = root;
    24             TreeNode[] rightSide = splitBST(root.right, V);
    25             root.right = rightSide[0];
    26             res[1] = rightSide[1];
    27         }
    28         
    29         return res;
    30     }
    31 }
  • 相关阅读:
    上市前为什么要分红
    在文件开始追加一行
    c++ 日期时间工具
    windows c++找不到time.h sys/types.h
    截取ls -l的某一列
    提取指定类型文件到指定目录,保留目录结构
    批量转换当前目录下的文件名为snake case
    vcpkg boost uuid Bcrypt 链接问题
    文件名pascal转underscore
    vcpkg cmake 找不到boost
  • 原文地址:https://www.cnblogs.com/EdwardLiu/p/11698350.html
Copyright © 2011-2022 走看看