Pregled bibliografske jedinice broj: 718251
Recursive and Nonrecursive Traversal Algorithms for Dynamically Created Binary Trees
Recursive and Nonrecursive Traversal Algorithms for Dynamically Created Binary Trees // Computer technology and application, 3 (2012), 5; 374-382 (podatak o recenziji nije dostupan, članak, znanstveni)
CROSBI ID: 718251 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Recursive and Nonrecursive Traversal Algorithms for Dynamically Created Binary Trees
Autori
Logozar, Robert
Izvornik
Computer technology and application (1934-7332) 3
(2012), 5;
374-382
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
binary -trees; algorithms; tree traversal; preorder; inorder; postorder; recursive; nonrecursive; space-time complexity
Sažetak
The modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L <= D. These are called ε-trees and ε-subtrees. The recursive and nonrecursive versions of the traversal algorithms for the trees with dynamically created nodes are discussed. The original nonrecursive algorithms that return the pointer to the next node in preorder, inorder and postorder traversals are presented. The space-time complexity analysis shows, and the execution time measurements confirm, that for these O(2^D) algorithms the recursive versions have approximately 10-25% better time constants. Still, the use of nonrecursive algorithms may be more appropriate in several occasions.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo
Poveznice na cjeloviti tekst rada:
Pristup cjelovitom tekstu rada www.davidpublishing.com www.airitilibrary.comCitiraj ovu publikaciju:
Uključenost u ostale bibliografske baze podataka::
- EBSCO
- ProQuest
- Cambridge Scientific Abstracts (CSA)
- American Federal Computer Library Center (OCLC)
- Chinese Database of CEPS
