 Sections
|
|
|
| |
| About Us
|
|
|
| |
| Partners
|
|
|
|
| Downloads
|
|
|
| |
|
|
|
WWWCoder.com Resource Directory
|
|
|
| An Extensive Examination of Data Structures Using C# 2.0, Part 4 | | :  |
| Hits Today: 0, Total: 1712 | Last Update: 2/16/2005 12:00:00 AM | |
|
 Add to Favorites | |
| Scott Mitchell provides a quick examination of AVL trees and red-black trees, which are two different self-balancing binary search tree data structures. He also covers skip lists, an ingenious data structure that turns a linked list into a data structure that offers the same running time as the more complex self-balancing tree data structures.
|
|
|
|
|
|
|
|
|
|
|
| Spotlight
|
|
|
|
| Syndication
|
|
|
| |
|
