Given a binary tree, the task is to check whether the nodes in this tree form an arithmetic progression, geometric progression or harmonic progression. Examples:… Read More »
Given a Binary Tree with positive values at each node, the task is to print the maximum number that can be formed by arranging nodes… Read More »
Given a Complete Binary Tree, the task is to print the elements in the following pattern. Let’s consider the tree to be: The tree is… Read More »
Prerequisite: Product of nodes at k-th level in a tree represented as string Given an integer ‘K’ and a binary tree in string format. Every… Read More »
Given a binary tree, the task is to print all the nodes except the rightmost in every level of the tree. The root is considered… Read More »
Shortest job first (SJF) or shortest job next, is a scheduling policy that selects the waiting process with the smallest execution time to execute next.… Read More »
Given a binary tree and an integer K, the task is to print the paths from root to leaf with the maximum element greater than… Read More »
Given a binary tree and a node K, the task is to delete the node K from it by making sure that tree shrinks from… Read More »
Given a binary tree with N nodes and an integer K, the task is to find the sum of all the nodes present at the… Read More »
Given an array arr[] of integers, the task is to remove duplicates from the given array. Examples: Input: arr[] = {1, 2, 3, 2, 5,… Read More »
Given a binary tree (not a binary search tree) and any number of Key Nodes, the task is to find the least common ancestor of… Read More »
Given an integer N, the task is to generate a random labelled tree of N node with (N – 1) edges without forming cycle. Note:… Read More »
Given a binary tree and a leaf node from this tree. It is known that in 1s all nodes connected to a given node (left… Read More »
Given an integer array arr and a number K, the task is to find the length of longest subarray such that all the elements in… Read More »
Given a Binary Tree, the task is to print spiral order traversal of the given tree. For below tree, the function should print 1, 2,… Read More »
