# Category: Binary Tree

## Print All Nodes of Binary Tree That Do not Have Siblings

“Print All Nodes of Binary Tree That Do not Have Siblings” is one of foremost algorithmic problem asked in a technical interview of product-based companies. Here, we are given a binary tree and our task is to write a program to print all nodes of binary tree that don’t have...

## Determine if two binary trees are identical or not

“Determine if two binary trees are identical or not” is a basic problem of tree data structure. Here, we are given two binary trees and our task is to write a program to determine if given two binary trees are identical or not. We can solve this problem both recursively and...

## Print all Root to Leaf Paths in a Binary Tree

“Print all Root to Leaf Paths in a Binary Tree” is an important algorithmic problem based on tree data. Here, we are given a binary tree and our task is to write a program to print all root to leaf paths in given binary tree. Here, the idea is to...

## Convert Binary Tree to its Mirror Tree

“Convert Binary Tree to its Mirror Tree” is a basic problem of tree data structure. Here, we are given a binary tree and our task is to write a program to convert given binary tree to its mirror tree. This is a simple problem and can be solved using various...

## Check if Binary Tree is Symmetric or Not

“Check if Binary Tree is Symmetric or Not” is a basic problem based on tree data structure. Here, we are given a binary tree and our task is to write a program to check if given binary tree have symmetric structure or not. A Binary Tree is having symmetric structure...

## Delete Binary Tree

“Delete Binary Tree” is an elementary problem based on tree data structure. Here, we are given a binary tree and our task is to delete given binary tree. We need to delete all the nodes and release memory. If tree needs to be deleted, then, it needs to be traversed...

## Check if two trees are mirror tree of each other

“Check if two trees are mirror tree of each other” is a basic problem based on tree data structure. Here, we are given two binary tree and our task is to write a program to check whether given two binary trees are mirror tree of each other. Two trees are...

## Top View of Binary Tree

“Top View of Binary Tree” is one of the foremost algorithmic problem asked in technical interviews of product-based companies. Here, we are given a binary tree and our task is to write a program to print the top view of given binary tree. Top View of Binary Tree is referred to...

## Bottom View of Binary Tree

“Bottom View of Binary Tree” is one of the foremost algorithmic problem asked in technical interviews of product-based companies. Here, we are given a binary tree and our task is to write a program to print the bottom view of given binary tree. Bottom View of Binary Tree is referred...

## Vertical Traversal of Binary Tree

“Vertical Traversal of Binary Tree” is one of the foremost algorithmic problem based on tree data structure asked in technical interview. Here, we are given a binary tree and our task is to traverse the given binary tree vertically. For vertical order traversal, we need to calculate Horizontal Distance (HD) for...