Leetcode 776. Split BST

Given a BST and a value V, partition the tree into two BSTs where one contains all nodes with values ≤ V and the other contains all nodes with values > V, preserving the original parent-child relationships. Use the BST ordering to decide splits efficiently (expected O(height) time).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 776. Split BST

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact