# Data Structure Note

Reference : Fundamentals of Data Structures in C, 2/e

## Tree
* [Tree](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/r1k2M1DaG)
* [Tree Transformation](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/Bk1W-tlhE)
* [M-way Search Tree](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/SysMt0v2E)
* [Splay Tree](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/By7HVVnh4)
* [Red-Black Tree](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/rJz7htK24)
* [AVL Tree](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/rypB96DnE)
* [Binary Tree](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/ryuLfsl24)
* [Extended Binary Tree](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/SJJ6ofDn4)
* [Threaded Binary Tree](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/HkYqOyAiV)

## Heap Tree
* [Heap Tree](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/BJwoCs3j4)
* [Min-Max Heap](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/HyxgysfhN)
* [Binomial Heap](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/BJ5zKf62E)
* [Fibonacci Heap](https://hackmd.io/@vRN1CwEsTLyHOsG4mC0d4Q/B1xRTOC24)