Red-Black Tree

(0)

Donner la première évaluation

High Quality Content by WIKIPEDIA articles! A red-black tree is a type of self-balancing binary search tree, a data structure used...

Prix bas

CHF32.30

Impression sur demande - l'exemplaire sera imprimé pour vous.

Pas de droit de retour !

Couverture cartonnée

Description

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.

Informations sur le produit

Titre:

Red-Black Tree

Sous-titre :

Self-Balancing Binary Search Tree, Computer Science, Associative Array, Rudolf Bayer, B-Tree, Leonidas J. Guibas, Robert Sedgewick, Big O Notation, Leaf Node, Tree

éditeur:

Lambert M. Surhone

Miriam T. Timpledon

Susan F. Marseken

EAN:

9786130347604

ISBN:

978-613-0-34760-4

Format:

Couverture cartonnée

Editeur:

Betascript Publishing