#109

Convert Sorted List to Binary Search Tree

medium · verified · 66.1% accepted · 7,856 likes · top 71%

linked list · divide and conquer · tree · binary search tree · binary tree

⊣ practice⊣ quiz⊣ open on leetcode ↗

Description

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: []

Solution