Pages that link to "Item:Q2369000"

The following pages link to A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000):

Displaying 13 items.

• A loopless algorithm for generating multiple binary tree sequences simultaneously (Q300220) (← links)
• A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
• Refined upper bounds for right-arm rotation distances (Q884484) (← links)
• Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees (Q1643905) (← links)
• Root-restricted Kleenean rotations (Q1944034) (← links)
• Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order (Q2082174) (← links)
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order (Q2321597) (← links)
• A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously (Q2867132) (← links)
• Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342) (← links)
• Effective splaying with restricted rotations (Q3506250) (← links)
• A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217) (← links)
• (Q5013818) (← links)