## Find the Deepest Node in a Binary Tree Using Queue STL – SET 2

Given a binary tree. The task is to find the value of the deepest node in the given binary tree. Examples: Input: Root of below… Read More »

- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Calculate height of Binary Tree using Inorder and Level Order Traversal
- Flatten Binary Tree in order of Level Order Traversal
- Count all k-sum paths in a Binary Tree
- Check if the given n-ary tree is a binary tree
- Find the Deepest Node in a Binary Tree Using Queue STL - SET 2
- Print all the nodes except the leftmost node in every level of the given binary tree
- Sum of nodes in the left view of the given binary tree
- Convert ternary expression to Binary Tree using Stack
- Flatten binary tree in order of post-order traversal
- Queries to find the maximum Xor value between X and the nodes of a given level of a perfect binary tree
- Duplicate subtree in Binary Tree | SET 2
- Find the color of given node in an infinite binary tree
- Find Maximum Level Sum in Binary Tree using Recursion
- Sum of nodes in the right view of the given binary tree
- Maximum XOR with given value in the path from root to given node in the tree
- Number of ways to divide a Binary tree into two halves
- Flatten Binary Tree in order of Zig Zag traversal
- Delete the last leaf node in a Binary Tree
- Convert a given Binary tree to a tree that holds Logical OR property
- Sink even nodes in Binary Tree
- Difference between General tree and Binary tree
- Skewed Binary Tree
- Extended Binary Tree

Given a binary tree. The task is to find the value of the deepest node in the given binary tree. Examples: Input: Root of below… Read More »

Given a binary tree and an integer k. The task is to count the number of paths in the tree with the sum of the… Read More »

Given an infinitely long binary tree having a pattern as below: 1 / \ 2 3 / \ / \ 4 5 6 7 /… Read More »

Given an n-ary tree, the task is to check whether the given tree is binary or not. Examples: Input: A / \ B C /… Read More »

Given a binary tree, the task is to flatten it in order of its post-order traversal. In the flattened binary tree, the left node of… Read More »

Given a binary tree, the task is to count the number of ways to remove a single edge from the tree such that the tree… Read More »

Given a Binary Tree, the task is to flatten it in order of Level order traversal of the tree. In the flattened binary tree, the… Read More »

Given a Binary Tree, the task is to flatten it in order of ZigZag traversal of the tree. In the flattened binary tree, the left… Read More »

Given a Binary Tree, convert it to a Circular Doubly Linked List. The left and right pointers in nodes are to be used as previous… Read More »

Given a binary tree, the task is to print all the nodes except the leftmost in every level of the tree. The root is considered… Read More »

Given a perfect binary tree of N nodes, with nodes having values from 1 to N as depicted in the image below and Q queries… Read More »

Given a complete binary tree, the task is to find the sum of mirror image nodes in an inorder way i.e. find the inorder traversal… Read More »

Given a binary tree in which nodes are numbered from 1 to N. Given a node and a positive integer K. We have to print… Read More »

Given a Binary Tree, the task is to find the size of largest Complete sub-tree in the given Binary Tree. Complete Binary Tree – A… Read More »

Given Preorder, Inorder and Postorder traversals of some tree. The task is to check if they all are of the same tree. Examples: Input :… Read More »