01Trie
Add features to trie to make it a self-balancing search tree
Advantages
- The fastest self-balancing search tree among most BST (Test most BST tree, much faster than AVL, splay, Dynamic Segment tree, B-tree, 2-3 Tree, red black tree)
- Easy to write and easy to debug
- Can deal with float number, type converse float to long long int
Fundamental Principle
convert any integer to 01 string and insert the 01 string into a trie dictionary
##Two versions
- A set that can insert X, get rank of X, find the Kth biggest number
- A Confluent Persistent 01 Trie for version control
