Dev tools: C-C++
File size: 19 KB
Describe: This is a binary search tree with void* pointer in data segment in order you to search store and delete O(n) worst case, O(log(n)) agerage case data.
File list(time 2009010821)(Click to check if it's the file you need, and recomment it at the bottom):
] - this code not only show you binary search
Tree, but also asm code for move your mouse!
] - fork trees and balanced binary
tree order to achieve the basic operation of the binary tree used for the storage structure (1), carriage return ( \ n)