## Find All Duplicate Subtrees

Given a binary tree, find all duplicate subtrees. For each duplicate subtrees, we only need to return the root node of any one of them.… 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
- 2-3 Trees | (Search and Insert)
- Print all even nodes of Binary Search Tree
- Search a node in Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- Shortest root to leaf path sum equal to a given number
- Level Ancestor Problem
- Flatten a binary tree into linked list | Set-3
- Print all nodes between two given levels in Binary Tree
- Difference between graph and tree
- Zig-Zag traversal of a Binary Tree using Recursion
- 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
- Preorder Traversal of N-ary Tree Without Recursion
- Counting inversions in an array using segment tree
- Number of subarrays have bitwise OR >= K
- Some Basic Theorems on Trees
- Clockwise Spiral Traversal of Binary Tree

Given a binary tree, find all duplicate subtrees. For each duplicate subtrees, we only need to return the root node of any one of them.… Read More »

Given a binary tree and two nodes. The task is to count the number of turns needs to reach from one node to another node… Read More »

Given a tree in form of adjacency list we have to calculate the number of nodes in the subtree of each node, while calculating the… Read More »

Profile: Application Engineer Recruitment Procedure (On-Campus) Test 1: This was an aptitude test of around 2 hrs. It consisted of four parts and had subsections.… Read More »

A leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Every node has an s-value (or rank… Read More »

Given two n-ary trees, the task is to check if they are mirror of each other or not. Print “Yes” if they are mirror of… Read More »

Given an array of elements, our task is to construct a complete binary tree from this array in level order fashion. That is, elements from… Read More »

Given a root of a tree, and an integer k. Print all the nodes which are at k distance from root. Example : Input :… Read More »

Given a Binary Tree and a key, write a function that returns level of the key. For example, consider the following tree. If the input… Read More »

Given two binary trees, we have to check if each of their levels are anagrams of each other or not. Example: Tree 1: Level 0… Read More »

In the SET 1 post on TST we have described how to insert and search a node in TST. In this article we will discuss… Read More »

Qualcomm visited for both Full time and Internship profiles for both hardware as well as software profiles. Round 1 1st Round was an online MCQ… Read More »

Given a perfect binary tree, print nodes of middle level without computing its height. A perfect binary tree is a binary tree in which all… Read More »

Factor Tree is an intuitive method to understand factors of a number. It shows how all the factors are been derived from the number. It… Read More »

Given a binary tree, print all the ancestors of a particular key existing in the tree without using recursion. Here we will be discussing the… Read More »