## Check if two nodes in a Binary Tree are siblings

Given a binary tree and two nodes, the task is to check if the nodes are siblings of each other or not. Two nodes are… 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 and two nodes, the task is to check if the nodes are siblings of each other or not. Two nodes are… Read More »

Given a binary tree in which each node element contains a number. The task is to find the minimum possible sum from one leaf node… Read More »

Given an n-ary tree of n vertices and n-1 edges. The tree is given in the form of adjacency list. Find number of subtrees of… Read More »

Given a Binary Tree having data at nodes as either 0’s or 1’s. The task is to find out whether there exists a subtree having… Read More »

Given a binary tree, the task is to count the number of Binary Search Trees present in it. Examples: Input: 1 / \ 2 3… Read More »

Given a tree as set of edges such that every node has unique value. We are also given a value k, the task is to… Read More »

Given a binary tree, the task is to print the nodes of the tree in an anti-clockwise spiral manner. Examples: Input: 1 / \ 2… Read More »

Given a binary tree, the task is to print the reverse level order in spiral form. Examples: Input: 1 / \ 2 3 / \… Read More »

Given an integer k and a tree with n nodes. The task is to count the number of distinct pairs of vertices which have a… Read More »

Given a Binary Tree, the task is to print the leaf nodes from left to right. The nodes must be printed in the order they… Read More »

Given three integers N, D and K. The task is to check whether it is possible to make a tree with exactly N vertices, D… Read More »

Given a Binary Tree, the task is to print the zigzag order of the tree. Examples: Input : 7 / \ 6 5 / /… Read More »

Given a binary tree and an integer K, the task is to remove all the nodes which are multiples of K from the given binary… Read More »

Given a Binary Tree with distinct values, the task is to print the first smallest root to leaf path. We basically need to print the… Read More »

Given an N-ary tree T of N nodes, the task is to calculate the longest path between any two nodes(also known as the diameter of… Read More »