Build A Min Height BST From A Sorted Array | Coding Interview Question
Back with another video and a special offer on our lifetime membership for you - use the promo code: APRIL40 to get 40% off on our subscription 🎉
Free 5-Day Mini-Course: https://backtobackswe.com
Try Our Full Platform: https://backtobackswe.com/checkout?pl...
📹 Intuitive Video Explanations
🏃 Run Code As You Learn
💾 Save Progress
❓ New Unseen Questions
Given a sorted array, create a binary search tree with minimal height.
Input:
[1, 2, 3, 4, 5, 6, 7]
Output:
[4, 2, 6, 1, 3, 5, 7]
Explanation:
4
/ \
2 6
/ \ / \
1 3 5 7
