题目来源:https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/
问题描述
109. Convert Sorted List to Binary Search Tree
Medium
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.