## Iterative approach to check if a Binary Tree is Perfect

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 »

- 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
- Zig Zag Level order traversal of a tree using single queue
- DFS traversal of a tree using recursion
- Shannon-Fano Algorithm for Data Compression
- Find the node with maximum value in a Binary Search Tree
- Insert a node in Binary Search Tree Iteratively
- Print path between any two nodes in a Binary Tree
- Iterative Method To Print Left View of a Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- 2-3 Trees | (Search and Insert)
- Print all even nodes of Binary Search Tree
- Search a node in Binary Tree
- Shortest root to leaf path sum equal to a given number
- Flatten a binary tree into linked list | Set-3
- Level Ancestor Problem
- Print all nodes between two given levels in Binary Tree
- Zig-Zag traversal of a Binary Tree using Recursion
- Difference between graph and tree
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Check whether a given binary tree is skewed binary tree or not?
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Sandvine Interview Experience for FTE 2018
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Counting inversions in an array using segment tree
- Some Basic Theorems on Trees
- Clockwise Spiral Traversal of Binary Tree
- Number of subarrays have bitwise OR >= K
- Reverse zigzag Traversal of a Binary Tree

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 »

Given a Perfect Binary Tree, the task is to reverse the alternate level nodes of the binary tree. Examples: Input: a / \ b c… Read More »

Given a binary tree, the task is to print nodes of extreme corners of each level but in alternate order. Examples: Input : 1 /… Read More »

Given a binary tree, write a function that returns true if the tree satisfies below property: For every node, data value must be equal to… Read More »

Given a Binary Tree. The task is to print the circular reverse clockwise spiral order traversal of the given binary tree. Reverse Clockwise Traversal means… Read More »

Given an undirected unweighted connected graph consisting of n vertices and m edges. The task is to find any spanning tree of this graph such… Read More »

Given a Binary tree, the task is to count the number of nodes with two children at a given level L. Examples: Input: 1 /… Read More »

Given a binary tree, the task is to print the maximum sum of nodes of a sub-tree which is also a Binary Search Tree. Examples:… Read More »

Given an array that represents a tree in such a way that array indexes are values in tree nodes and array values give the parent… Read More »

Given a binary tree, the task is to create a new binary tree which is a mirror image of the given binary tree. Examples: Input:… Read More »

Given a tree having every node’s value as either 0 or 1, the task is to find whether the given binary tree contains any sub-tree… Read More »

Given a tree having every node’s value as either 0 or 1, the task is to find the maximum size of the sub-tree in the… Read More »

Given an unsorted array, trim the array such that twice of minimum is greater than maximum in the trimmed array. Elements should be removed from… Read More »