problem0109

README

109. Convert Sorted List to Binary Search Tree

题目

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.

Example:

Given the sorted linked list: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

解题思路

见程序注释

又见 100% ，感谢 LeetCode 服务器。

Documentation

Index

• type ListNode
• type TreeNode

Types

type ListNode

type ListNode = kit.ListNode

ListNode is 题目预先定义的数据结构

type TreeNode

type TreeNode = kit.TreeNode

TreeNode is 题目预先定义的数据结构