You might also like

More about Binary Tree Sequence Rotations and t-ary Tree Enumerations

• Book details
• Synopsis
• Trending among others

You get 121 loyalty points

Book synopsis

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.

Book details

Book category Books in English Computing & information technology Information technology: general issues

• Full title: Binary Tree Sequence Rotations and t-ary Tree Enumerations
• Author: Ro-Yu Wu, Yue-Li Wang, Jou-Ming Chang
• Language: English
• Binding: Paperback
• Number of pages: 96
• EAN: 9783639176346
• ISBN: 3639176340
• ID: 06825911
• Publisher: VDM Verlag
• Weight: 150 g
• Dimensions: 229 × 152 × 6 mm
• Date of publishing: 03. July 2009

Trending among others

---

---

---