算法的可视化

某种算法的解析

Tree data structures

Binary search tree

这应该算一种数据结构。通过某种算法加成，可以使这种数据结构具有自平衡特性。使用不同的算法会有不同的加成：

splay tree

Hashing

Radix Sort

TimSort

T-Tree

A T-tree is a balanced index tree data structure optimized for cases where both the index and the actual data are fully kept in memory, just as a B-tree is an index structure optimized for storage on block oriented secondary storage devices like hard disks. T-trees seek to gain the performance benefits of in-memory tree structures such as AVL trees while avoiding the large storage space overhead which is common to them.

Interval Tree

其他

书籍

文章

Github Repo

有趣的视频