No disponible.
¿Tienes uno para vender? Vender en Amazon
Volver atrás Ir adelante
Escuchar Reproduciendo... Interrumpido   Estás escuchando una muestra de la edición de audio Audible.
Más información
Ver esta imagen

Trees (structure): Tree, B-tree, Tree structure, Abstract syntax tree, Binary space partitioning, Leaf node, Trie, Phylogenetic tree (Inglés) Tapa blanda – 4 sep 2011


Ver los formatos y ediciones Ocultar otros formatos y ediciones
Precio Amazon
Nuevo desde Usado desde
Tapa blanda, 4 sep 2011
click to open popover

Descripción del producto

Reseña del editor

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 77. Chapters: Tree, B-tree, Tree structure, Abstract syntax tree, Binary space partitioning, Leaf node, Trie, Phylogenetic tree, Tree automaton, Parse tree, Quadtree, Octree, Suffix tree, Kd-tree, Interval tree, Stern-Brocot tree, Tree traversal, B+ tree, Segment tree, Van Emde Boas tree, Figurative system of human knowledge, AA tree, Calkin-Wilf tree, SPQR tree, Implicit kd-tree, Radix tree, Enfilade, Bounding interval hierarchy, Dialog tree, Self-balancing binary search tree, Ternary tree, Hash tree, Leftist tree, Infinite tree automaton, GiST, Newick format, Embedded Zerotrees of Wavelet transforms, PQ tree, Hyperbolic tree, Trinomial tree, Radial tree, Finger tree, Tree walking automaton, Min/max kd-tree, Expectiminimax tree, And-or tree, Sentinel value, Generalised suffix tree, Tree rearrangement, Pebble automaton, Cover tree, Trace tree, Dancing tree, T-theory, Ternary search tree, UB-tree, DSW algorithm, Fenwick tree, Branching factor, Sentinel node, Polychotomous key, BK-tree, Htree, Left rotation, VP-tree, Range tree, Exponential tree, Hash trie, (a,b)-tree, Hypertree, Split, Dendrogram, Prediction Suffix Tree, B-trie, Fusion tree, Tree homomorphism, Link/cut tree, Linear octree, Doubly-chained tree, Metric tree, B sharp tree, Adaptive k-d tree, Semantic resolution tree. Excerpt: In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic amortized time. The B-tree is a generalization of a binary search tree in that a node can have more than two children. (Comer 1979, p. 123) Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data. It is commonly used in databases and filesystems. A B-tree of order 2 (Bayer & McCreight 1972) or order 5 (Knuth 1997). In B-trees,...

No es necesario ningún dispositivo Kindle. Descárgate una de las apps de Kindle gratuitas para comenzar a leer libros Kindle en tu smartphone, tablet u ordenador.

  • Apple
  • Android
  • Windows Phone

Obtén la app gratuita:



Detalles del producto


Opiniones de clientes

No hay opiniones de clientes
Comparte tu opinión con otros clientes