Contact
How to shop
Delivery
Shopping guide
Binary Tree Sequence Rotations and t-ary Tree Enumerations
English
121 b
Up to 30 days for returns
Customers also purchased
/
Paperback
19.15
€
/
Paperback
16.13
€
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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
16.13
€
/
Paperback
26.82
€
/
Paperback
9.87
€
/
Paperback
12.70
€
/
Paperback
20.26
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?