Binary Tree
CHF 43.15
Auf Lager
SKU
8LOTJ07RIEV
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Di., 04.11.2025 und Mi., 05.11.2025
Details
In computer science, a binary tree is a tree data structure in which each node has at most two children. Typically the first node is known as the parent and the child nodes are called left and right. In type theory, a binary tree with nodes of type A is defined inductively as TA = . 1 + A × × . Binary trees are commonly used to implement binary search trees and binary heaps.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786130273828
- Editor Frederic P. Miller, Agnes F. Vandome, John McBrewster
- Sprache Englisch
- Größe H220mm x B150mm x T6mm
- Jahr 2010
- EAN 9786130273828
- Format Fachbuch
- ISBN 978-613-0-27382-8
- Titel Binary Tree
- Untertitel Tree (Data Structure), Type Theory, Recursive Data Type, Binary Search Tree, Binary Heap, Computer Science, Tree Traversal, 2-3 Tree, AA Tree, B-Tree, Binary Space Partitioning, Kraft´s Inequality
- Gewicht 165g
- Herausgeber Alphascript Publishing
- Anzahl Seiten 100
- Genre Informatik
Bewertungen
Schreiben Sie eine Bewertung
