2019年3月30日
【leetcode】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-balance 阅读全文
posted @ 2019-03-30 09:22 seyjs 阅读(241) 评论(0) 推荐(0)
【leetcode】108. Convert Sorted Array to Binary Search Tree
摘要： 题目如下： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tre 阅读全文
posted @ 2019-03-30 09:16 seyjs 阅读(182) 评论(0) 推荐(0)