Given an integer array `nums` where the elements are sorted in ascending order, convert it to a height-balanced binary search tree (BST). A height-balanced BST is defined as a binary tree in which the…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.