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. 看到这题我想到的直接的做法是每次找到链表的中间结点（slow 和 fast双指针 阅读全文
posted @ 2016-05-31 22:23 Sheryl Wang 阅读(143) 评论(0) 推荐(0) 编辑
