A generic code of Tree implement of Java,including RedBlackTree,AVLTree and AATree,which can solve structral treatment of plenty of data. In these three structures of binary-tree,I think red-black-tree has the best performance. You can just put it into your project and use it as a composition.The code is clear and simple.
-
Notifications
You must be signed in to change notification settings - Fork 0
Isahhx/Tree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A generic code of Tree implement of Java,including RedBlackTree,AVLTree and AATree,which can solve structral treatment of plenty of data.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published