Skip to content

Commit

Permalink
fix: fix typo
Browse files Browse the repository at this point in the history
  • Loading branch information
JevanWu committed Feb 24, 2023
1 parent 686c615 commit ef31d9b
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion _posts/2021-09-13-数据结构的联系与使用.md
Original file line number Diff line number Diff line change
Expand Up @@ -131,7 +131,7 @@ BloomFilter是一个很长的二进制向量(可以使用BitSet, 也可以使用

### BinaryTree

那要让二分查找法在Tree中的效率最高,就最好是每个节点下都之后两个子节点,这种类型的Tree我们叫它BinaryTree。所以BinarySearchTree理论上是Tree中搜索速度最快的。
那要让二分查找法在Tree中的效率最高,就最好是每个节点下最多有两个子节点,这种类型的Tree我们叫它BinaryTree。所以BinarySearchTree理论上是Tree中搜索速度最快的。

### BalancedTree([AVL Tree](https://en.wikipedia.org/wiki/AVL_tree#Balance_factor), [Treap](http://faculty.cs.niu.edu/~freedman/340/340notes/340treap.htm), Splay Tree, [RedBlackTree](https://www.bilibili.com/video/BV1zU4y1H77f?from=search&seid=18100567436420416474&spm_id_from=333.337.0.0) et al.)

Expand Down

0 comments on commit ef31d9b

Please sign in to comment.