Description: Integrated 2-tree and B tree based on the merits of additions and deletions instead of splitting or merging of the integrity of the procedure (now to 8bit (BYTE key) for the keywords, can be expanded to 64bit the double for key, user data packets that now float ton , scalable to any structure struct)
- [bplus] - A simple easy to use B tree algorithm r
- [EVC_Book] -
- [B_Tree] - Using the console to achieve the classic
- [lab03] - The establishment of a tree, using the f
File list (Check if you may need any files):
b_tree16.c
Download