## Construct Special Binary Tree from given Inorder traversal

Given Inorder Traversal of a Special Binary Tree in which key of every node is greater than keys in left and right children, construct the… 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 Inorder Traversal of a Special Binary Tree in which key of every node is greater than keys in left and right children, construct the… Read More »

Given a Binary Tree, convert it to a Binary Search Tree. The conversion must be done in such a way that keeps the original structure… Read More »

Given two Binary Search Trees(BST), print the elements of both BSTs in sorted form. The expected time complexity is O(m+n) where m is the number… Read More »

Given a Binary Tree, find the maximum sum path from a leaf to root. For example, in the following tree, there are three leaf to… Read More »

We have discussed AVL insertion in the previous post. In this post, we will follow a similar approach for deletion. Steps to follow for deletion.… Read More »

Given a Binary Tree, find the vertical sum of the nodes that are in the same vertical line. Print all sums through different vertical lines.… Read More »

AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for… Read More »

Given a Binary Tree, write a function that returns the size of the largest subtree which is also a Binary Search Tree (BST). If the… Read More »

Given a Binary Tree where each node has positive and negative values. Convert this to a tree where each node contains the sum of the… Read More »

Given a Binary Tree where each node has following structure, write a function to populate next pointer for all nodes. The next pointer for every… Read More »

Given a sorted array. Write a function that creates a Balanced Binary Search Tree using array elements. Examples: Input: Array {1, 2, 3} Output: A… Read More »

Write a function to connect all the adjacent nodes at the same level in a binary tree. Structure of the given Binary Tree node is… Read More »

Given two binary trees, check if the first tree is subtree of the second one. A subtree of a tree T is a tree S… Read More »

Write a function that returns true if the given Binary Tree is SumTree else false. A SumTree is a Binary Tree where the value of… Read More »