2019年9月2日
235. Lowest Common Ancestor of a Binary Search Tree
摘要： Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedia 阅读全文
posted @ 2019-09-02 04:55 Schwifty 阅读(159) 评论(0) 推荐(0)
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 bina 阅读全文
posted @ 2019-09-02 04:08 Schwifty 阅读(194) 评论(0) 推荐(0)