Download now Free registration required
Although Binary Search Trees (BSTs) are used widely, as data gets added, binary search trees tend to degenerate into an unordered linked list over time. The "Red-black tree" is a related type of binary tree that's often more suitable for certain types of search operations. This paper discusses how red-black trees facilitate faster searches and become less disordered over time than similar data structures, and shows how to build and search a red-black tree in C#.
- Format: HTML
- Size: 0 KB