Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Binary Tree Sequence Rotations and t-ary Tree Enumerations
Engleski
115 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
Meki uvez
19.17
€
/
Meki uvez
16.15
€
In this book, we consider a transformation on binary§trees using new types of rotations. Each of the newly§proposed rotations is permitted only at nodes on the§left-arm or the right-arm of a tree. Consequently, we§develop a linear time algorithm with at most n 1§rotations for converting weight sequences between any§two binary trees.§we use right distance sequences (or RD-sequences for§short), to describe all t-ary trees with n internal§nodes. Using a t-ary recursion tree and its§concomitant tables, a systematical way can help us to§investigate the structural representation of t-ary§trees. Consequently, we develop efficient algorithms§for determining the rank of a given t-ary tree in§lexicographic order (i.e., the ranking algorithm),§and for converting a positive integer to its§corresponding RD-sequence (i.e., the unranking§algorithm). Both the ranking and unranking algorithms§can be run in O(tn) time and without really building§any auxiliary table. In addition, we also present a§loopless algorithm to enumerate Gray-codes of t-ary§trees using RD-sequences.
Informacije o knjizi
Engleski
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
26.85
€
/
Meki uvez
16.15
€
/
Meki uvez
12.71
€
/
Meki uvez
20.28
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?