## Print all nodes in a binary tree having K leaves

Given a binary tree and a integer value K, the task is to find all nodes in given binary tree having K leaves in subtree… Read More »

- MakeMyTrip Interview Experience 2019
- Print the nodes of binary tree as they become the leaf node
- Iterative Method To Print Left View of a Binary Tree
- Shannon-Fano Algorithm for Data Compression
- Print path between any two nodes in a Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- Search a node in Binary Tree
- Flatten a binary tree into linked list | Set-3
- Zig-Zag traversal of a Binary Tree using Recursion
- Difference between graph and tree
- Shortest root to leaf path sum equal to a given number
- Remove minimum elements from either side such that 2*min becomes more than max | Set 2
- Clockwise Spiral Traversal of Binary Tree
- Reverse zigzag Traversal of a Binary Tree
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Number of subarrays have bitwise OR >= K
- Iterative Boundary traversal of Complete Binary tree
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Reverse Level Order traversal in spiral form
- Find the number of distinct pairs of vertices which have a distance of exactly k in a tree
- Building Expression tree from Prefix Expression
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Sum of all odd nodes in the path connecting two given nodes
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
- Range Sum Queries and Update with Square Root
- Print all the levels with odd and even number of nodes in it | Set-2
- Sum of all the Boundary Nodes of a Binary Tree
- Distribute candies in a Binary Tree

Given a binary tree and a integer value K, the task is to find all nodes in given binary tree having K leaves in subtree… Read More »

Given a binary tree with a value associated with each node, we need to choose a subset of these nodes such that sum of chosen… Read More »

Given a Binary Tree having positive and negative nodes, the task is to find maximum sum level in it. Examples: Input : 4 / \… Read More »

Given a binary tree, print the number of root to leaf paths having equal lengths. Examples: Input : Root of below tree 10 / \… Read More »

A tree is Continuous tree if in each root to leaf path, absolute difference between keys of two adjacent is 1. We are given a… Read More »

Given a binary tree, find if there is a pair in root to a leaf path such that sum of values in pair is equal… Read More »

It was a walk-in for experienced candidates actually. Round 1: Machine Coding Round (60 min) Q1. Infix to Postfix conversion e.g. A+(B-C)*D becomes ABC-D*+ Q2.… Read More »

Given a binary tree and an array, the task is to find if the given array sequence is present as a root to leaf path… Read More »

Given a binary tree and integer value k, the task is to swap sibling nodes of every k’th level where k >= 1. Examples: Input… Read More »

Given a Binary Tree find the length of the longest path which comprises of nodes with consecutive values in increasing order. Every node is considered… Read More »

I recently got interviewed for MakeMyTrip for the Software Engineer full time position. There were in a total of 5 rounds. First Round (Online Coding… Read More »

Given a binary tree, the task is to flip the binary tree towards right direction that is clockwise. See below examples to see the transformation.… Read More »

Given an array arr[0..n-1]. The following operations need to be performed. update(l, r, val) : Add ‘val’ to all the elements in the array from… Read More »

MAQ Software Interview Experience (On-Campus FTE+Internship) There were four rounds. Round 1: This round was an offline written round.It consisted of 30 aptitiude questions… Read More »