Given the head of a singly linked list where elements are sorted in ascending order , convert
Fantastic news! We've Found the answer you've been seeking!
Question:
Given the head of a singly linked list where elements are sorted in ascending order, convert it to a
height-balanced
binary search tree.
Example 1:
Input: head = [-10,-3,0,5,9]Output: [0,-3,9,-10,null,5]Explanation: One possible answer is [0,-3,9,-10,null,5], which represents the shown height balanced BST.Example 2:
Input: head = []Output: []
Constraints:
- The number of nodes in head is in the range [0, 2 * 104].
- -105
Related Book For
Data Structures and Algorithms in Java
ISBN: 978-1118771334
6th edition
Authors: Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser
Posted Date: