## Kth node in Diagonal Traversal of Binary Tree

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 »

- 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
- 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 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 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 a binary tree, the task is to print the sum of nodes in bottom view of the given Binary Tree. Bottom view of a… Read More »

Given a Binary Tree. The task is to print the circular clockwise spiral order traversal of the given binary tree. Examples: Input : 1 /… Read More »

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