Print Bottom-Right View of a Binary Tree
Given a Binary Tree, print Bottom-Right view of it. The Bottom Right view of a Binary Tree is a set of nodes visible when the… Read More »
Category Archives: Recursion
Count Set-bits of number using Recursion
Given a number N. The task is to find the number of set bits in its binary representation using recursion. Examples: Input : 21 Output… Read More »
Print all Increasing Subsequence of a List
Given a list or array of integer, the task is to print all such subsequences of this list such in which the elements are arranged… Read More »
Traverse Linked List from middle to left-right order using recursion
Given a Linked List. The task is to traverse the Linked List from middle to left-right order using recursion. For Example: If the given Linked… Read More »
Triangle of numbers arising from Gilbreath’s conjecture
The task is to find the triangle of numbers arising from Gilbreath’s conjecture. Gilbreath’s conjecture: It is observed that given a sequence of prime numbers,… Read More »
Van Emde Boas Tree | Set 1 | Basics and Construction
It is highly recommended to fully understand Proto Van Emde Boas Tree. Van Emde Boas Tree supports search, successor, predecessor, insert and delete operations in… Read More »
Nearest greater number by interchanging the digits
Given two integers A and B. The task is to find the nearest greater value to B by interchanging the digits of A. If no… Read More »
Proto Van Emde Boas Tree | Set 3 | Insertion and isMember Query
Please see previous articles on Proto Van Emde Boas Tree to understand these properly. Procedure for Insert: Base Case: If the size of Proto-VEB is… Read More »
Proto Van Emde Boas Trees | Set 4 | Deletion
Please check previous sets of Proto Van Emde Boas Tree article first. It is highly recommended. Procedure for delete: Base Case: If we reach at… Read More »
Proto Van Emde Boas Tree | Set 5 | Queries: Minimum, Maximum
Please check previous sets of Proto Van Emde Boas Tree article first. It is highly recommended. Procedure for finding minimum: Base Case: If the size… Read More »
Proto Van Emde Boas Tree | Set 6 | Query : Successor and Predecessor
Please refer all previous articles on Proto Van Emde Boas Tree first. Successor Query Procedure: Base case: For Proto-VEB of size 2 the only possibility… Read More »
Programs to print Triangle and Diamond patterns using recursion
This article is aimed at giving a recursive implementation for pattern printing. Pattern 1: Example: Input: 5 Output: * * * * * * *… Read More »
Sum of even elements of an Array using Recursion
Given an array arr[] of integers, the task is to find the sum of even elements from the array. Examples: Input: arr[] = {1, 2,… Read More »
Recursive program to replace all occurrences of pi with 3.14 in a given string
Given string str of size N. The task is to write a recursive function to replace all occurrences of pi with 3.14 in the given… Read More »
Proto Van Emde Boas Tree | Set 2 | Construction
Van Emde Boas Tree supports search, minimum, maximum, successor, predecessor, insert and delete operations in O(lglgN) time which is faster than any of related data… Read More »
