## Queries to update a given index and find gcd in range

Given an array arr[] of N integers and queries Q. Queries are of two types: Update a given index ind by X. Find the gcd… Read More »

- MakeMyTrip Interview Experience 2019
- Print nodes in the Top View of Binary Tree | Set 3
- Print the nodes of binary tree as they become the leaf node
- Shannon-Fano Algorithm for Data Compression
- Insert a node in Binary Search Tree Iteratively
- Find the node with maximum value in a Binary Search Tree
- Iterative Method To Print Left View of a Binary Tree
- Print path between any two nodes in a Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- 2-3 Trees | (Search and Insert)
- Search a node in Binary Tree
- Print all even nodes of Binary Search Tree
- Flatten a binary tree into linked list | Set-3
- Zig-Zag traversal of a Binary Tree using Recursion
- Shortest root to leaf path sum equal to a given number
- Difference between graph and tree
- Print all nodes between two given levels in Binary Tree
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Clockwise Spiral Traversal of Binary Tree
- Some Basic Theorems on Trees
- Check whether a given binary tree is skewed binary tree or not?
- Remove minimum elements from either side such that 2*min becomes more than max | Set 2
- Number of subarrays have bitwise OR >= K
- Reverse zigzag Traversal of a Binary Tree
- Counting inversions in an array using segment tree
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Find the number of distinct pairs of vertices which have a distance of exactly k in a tree
- Iterative Boundary traversal of Complete Binary tree
- Sum of all odd nodes in the path connecting two given nodes

Given an array arr[] of N integers and queries Q. Queries are of two types: Update a given index ind by X. Find the gcd… Read More »

Given a Binary Tree, where each node contains an extra empty pointer initially null. The task is to connect all nodes of the binary tree… Read More »

Given a binary tree containing n nodes. The task is to find the sum of all the leaf nodes present at maximum level. Examples: Input:… Read More »

Given a binary tree, the task is to find the maximum length of the cycle that can be formed by joining any two nodes of… Read More »

Given a binary tree and an integer k, the task is to print the kth node in the vertical order traversal of binary tree.If no… Read More »

Given a Tree with N nodes, the task is to find a triplet of nodes (a, b, c) such that the number of nodes covered… Read More »

Given an array arr[] of size N. There are two types of operations: Update(l, r, x) : Increment the a[i] (l <= i <= r)… Read More »

Given a number N which is the total number of nodes in a complete binary tree where nodes are number from 1 to N sequentially… Read More »

Given a tree with N nodes, and two integers K and V. The task is to find the Kth node in the DFS traversal of… Read More »

Given a tree with n nodes and a number associated with every node. We can break any edge of the tree which will result in… Read More »

Given a N-ary tree with a value associated with each node, the task is to choose a subset of these nodes such that sum of… Read More »

Given a binary tree, the task is to find the Lowest Common Ancestor of the given two nodes in the tree. Let G be a… Read More »

Given a Binary Tree, the task is to check whether the given Binary Tree is a perfect Binary Tree or not. A Binary tree is… Read More »

Given a binary tree and a value K. The task is to print the k-th node in the diagonal traversal of the binary tree. If… Read More »

Given a binary tree, the task is to print all the leaf nodes of the binary tree from right to left. Examples: Input : 1… Read More »