zoukankan      html  css  js  c++  java
  • LeetCode

    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.

    递归,操作二叉搜索树

    /**
     * Definition for a binary tree node.
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;
     *     TreeNode(int x) { val = x; }
     * }
     */
    class Solution {
        public TreeNode[] splitBST(TreeNode root, int V) {
            if (root == null)
                return new TreeNode[]{null, null};
            if (root.val == V) {
                TreeNode right = root.right;
                root.right = null;
                return new TreeNode[]{root, right};
            }
            else if (root.val > V) {
                TreeNode[] nodes = splitBST(root.left, V);
                TreeNode left = nodes[0];
                TreeNode right = nodes[1];
                root.left = right;
                return new TreeNode[]{left,root};
            } else {
                TreeNode[] nodes = splitBST(root.right, V);
                TreeNode left = nodes[0];
                TreeNode right = nodes[1];
                root.right=left;
                return new TreeNode[]{root, right};
            }
            
        }
    }
  • 相关阅读:
    Spring DI模式 小样例
    java中经常使用的日期格式化(全)
    循环-15. 统计素数并求和(20)
    [Unity3D]Unity3D游戏开发之自己主动寻路与Mecanim动画系统的结合
    【UVA】11732
    Mac OS使用技巧之十六:系统失去响应怎么办?
    C# 保存窗口为图片(保存纵断面图)
    Linux Resin 安装
    Etcd学习(二)集群搭建Clustering
    android中选择控件与选择界面自然过度效果的实现--一种新的交互设计
  • 原文地址:https://www.cnblogs.com/wxisme/p/8427770.html
Copyright © 2011-2022 走看看