Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Red-Black Tree
CHF 49.55
Auf Lager
SKU
K6J27GDLG2P
1 Verfügbar 
Geliefert zwischen Mi., 26.11.2025 und Do., 27.11.2025
Details
High Quality Content by WIKIPEDIA articles! 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.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786130347604
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Größe H220mm x B150mm x T7mm
- Jahr 2010
- EAN 9786130347604
- Format Fachbuch
- ISBN 978-613-0-34760-4
- Titel Red-Black Tree
- Untertitel Self-Balancing Binary Search Tree, Computer Science, Associative Array, Rudolf Bayer, B-Tree, Leonidas J. Guibas, Robert Sedgewick, Big O Notation, Leaf Node, Tree
- Gewicht 189g
- Herausgeber Betascript Publishers
- Anzahl Seiten 116
- Genre Informatik
Bewertungen
Schreiben Sie eine Bewertung
