2020年11月1日
leetcode426 - Convert Binary Search Tree to Sorted Doubly Linked List - medium
摘要： Convert a Binary Search Tree to a sorted Circular Doubly-Linked List in place. You can think of the left and right pointers as synonymous to the prede 阅读全文
posted @ 2020-11-01 12:52 little_veggie 阅读(58) 评论(0) 推荐(0)
leetcode109 - Convert Sorted List to Binary Search Tree - medium
摘要： Given the head of a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-b 阅读全文
posted @ 2020-11-01 11:50 little_veggie 阅读(100) 评论(0) 推荐(0)