Tree Traversal
CHF 43.20
Auf Lager
SKU
5GJRLD36KUC
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Mi., 05.11.2025 und Do., 06.11.2025
Details
High Quality Content by WIKIPEDIA articles! In computer science, tree-traversal refers to the process of visiting (examining and/or updating) each node in a tree data structure, exactly once, in a systematic way. Such traversals are classified by the order in which the nodes are visited. The following algorithms are described for a binary tree, but they may be generalized to other trees as well. Compared to linear data structures like linked lists and one dimensional arrays, which have only one logical means of traversal, tree structures can be traversed in many different ways. Starting at the root of a binary tree, there are three main steps that can be performed and the order in which they are performed defines the traversal type.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786130355142
- Genre Technik
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Anzahl Seiten 88
- Herausgeber VDM Verlag Dr. Müller e.K.
- Größe H220mm x B150mm x T5mm
- Jahr 2010
- EAN 9786130355142
- Format Fachbuch
- ISBN 978-613-0-35514-2
- Titel Tree Traversal
- Untertitel Tree Traversal, Computer Science, Tree (Data Structure), Binary Tree, List of Data Structures, Linked List, Array Data Structure
- Gewicht 149g
Bewertungen
Schreiben Sie eine Bewertung
