What is Calkin Wilf Sequence?
A Calkin-Wilf tree (or sequence) is a special binary tree which is obtained by starting with the fraction 1/1 and adding a/(a+b) and (a+b)/b iteratively below each fraction a/b. This tree generates every rational number. Writing out the terms in a sequence gives 1/1, 1/2, 2/1, 1/3, 3/2, 2/3, 3/1, 1/4, 4/3, 3/5, 5/2, 2/5, 5/3, 3/4, 4/1, …The sequence has the property that each denominator is the next numerator.
The image above is the Calkin-Wilf Tree where all the rational numbers are listed. The children of a node a/b is calculated as a/(a+b) and (a+b)/b.
The task is to find the nth rational number in breadth first traversal of this tree.
Input : 13 Output : [5, 3] Input : 5 Output : [3, 2]
Explanation: This tree is a Perfect Binary Search tree and we need floor(log(n)) steps to compute nth rational number. The concept is similar to searching in a binary search tree. Given n we keep dividing it by 2 until we get 0. We return fraction at each stage in the following manner:-
if n%2 == 0 update frac+=frac else update frac+=frac
Below is the program to find the nth number in Calkin Wilf sequence:
For n = 13,
- Maximum rational number (or fraction) from an array
- k-th number in the Odd-Even sequence
- Find LCM of rational numbers
- Find max of two Rational numbers
- Ulam Number Sequence
- Minimum operations required to transform a sequence of numbers to a sequence where a[i]=a[i+2]
- HCF of array of fractions (or rational numbers)
- Number of words in a camelcase sequence
- Form minimum number from given sequence
- k-th missing element in increasing sequence which is not present in a given sequence
- N-th term of George Cantor set of rational numbers
- as_integer_ratio() in Python for reduced fraction of a given rational
- Algorithm to generate positive rational numbers
- Minimum number of deletions to make a sorted sequence
- Number of Binary Trees for given Preorder Sequence length
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : Harshit Saini