Interviews
[Amazon] Cut BST
Cut BST
Given a BST, and an integer k, cut the BST vertically into two substrees A and B, where all nodes in A <= k and all nodes in B > k.
Contrain: for any node A and it’s parent B in the original BST. If after the cut they are both in the same subtree. B should still be the parent of A.
example:
Input:
50
/ \
20 60
/ \ / \
10 30 55 70
k = 50
output:
20
/ \
10 30
and
60
/ \
55 70
List<TreeNode> cutBST(TreeNode root, int k);
Solve the problem:
One-on-One Algorithm and Coding Training
One-on-One System Design Training
One-on-One Mock Interview
Get one-to-one training from Google Facebook engineers
Top-notch Professionals
Learn from Facebook, Google, Uber senior engineers interviewed 100+ candidates.aonecode.com
Most recent interview questions and system design topics gathered from aonecode alumnus.
One-to-one online classes. Get feedbacks from real interviewers.
Customized Private Class
Already a coding expert? - Advance straight to hard interview topics of your interest.
New to the ground? - Develop basic coding skills with your own designated mentor.
Days before
interview? - Focus on most important problems in target company question bank.
aonecoding@gmail.com