Skip to content

Commit 47b46b1

Browse files
committed
add leetcode link
1 parent 45e9ec8 commit 47b46b1

File tree

2 files changed

+9
-0
lines changed

2 files changed

+9
-0
lines changed

docs/03_链表/linked_list.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -99,5 +99,9 @@ cdll.tailnode() | O(1) |
9999

100100
# Leetcode
101101

102+
反转链表 [reverse-linked-list](https://leetcode.com/problems/reverse-linked-list/)
103+
102104
这里有一道关于 LRU 的练习题你可以尝试下。
103105
[LRU Cache](https://leetcode.com/problems/lru-cache/description/)
106+
107+
合并两个有序链表 [merge-two-sorted-lists](/https://leetcode.com/problems/merge-two-sorted-lists/submissions/)

docs/17_二叉查找树/binary_search_tree.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -244,3 +244,8 @@ bst = BST.build_from(NODE_LIST)
244244
- 《Data Structures and Algorithms in Python》14 章,树的概念和算法还有很多,我们这里介绍最基本的帮你打个基础
245245
- 了解红黑树。普通二叉查找树有个很大的问题就是难以保证树的平衡,极端情况下某些节点可能会非常深,导致查找复杂度大幅退化。而平衡二叉树就是为了解决这个问题。请搜索对应资料了解下。
246246
- 了解 mysql 索引使用的 B-Tree 结构(多路平衡查找树),这个是后端面试数据库的常考点。想想为什么?当元素非常多的时候,二叉树的深度会很深,导致多次磁盘查找。[从B树、B+树、B*树谈到R 树](https://blog.csdn.net/v_JULY_v/article/details/6530142)
247+
248+
249+
# Leetcode
250+
251+
验证是否是合法二叉搜索树 [validate-binary-search-tree](https://leetcode.com/problems/validate-binary-search-tree/

0 commit comments

Comments
 (0)