caleblipan/2-4_tree
A 2 - 4 tree is self - balancing data structure commonly used in dictionaries. 2 - 4 trees perform searching, insertion and deletion in the order of O (log n).
Java
Watchers
No one’s watching this repository yet.
A 2 - 4 tree is self - balancing data structure commonly used in dictionaries. 2 - 4 trees perform searching, insertion and deletion in the order of O (log n).
Java
No one’s watching this repository yet.