Items related to Red-Black Tree: Self-Balancing Binary Search Tree,...
Red-Black Tree: Self-Balancing Binary Search Tree, Computer Science, Associative Array, Rudolf Bayer, B-Tree, Leonidas J. Guibas, Robert Sedgewick, Big O Notation, Leaf Node, Tree - Softcover
Reseña del editor
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A red-black tree is a type of self-balancing binary search tree, a data structure used in computing science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer: who called them symmetric binary B-trees", but acquired its modern name in a paper in 1978 by Leonidas J. Guibas and Robert Sedgewick. It is complex, but has good worst-case running time for its operations and is efficient in practice: it can search, insert, and delete in O(log n) time, where n is total number of elements in the tree. Put very simply, a red-black tree is a binary search tree which inserts and removes intelligently, to ensure the tree is reasonably balanced."
"About this title" may belong to another edition of this title.
- PublisherBetascript Publishing
- Publication date2010
- ISBN 10 613034760X
- ISBN 13 9786130347604
- BindingTapa blanda
- LanguageEnglish
- Number of pages116
- EditorSurhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want