## Print leaf nodes in binary tree from left to right using one stack

Given a binary tree, the task is to print all leaf nodes of the given binary tree from left to right. That is, the nodes… 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, the task is to print all leaf nodes of the given binary tree from left to right. That is, the nodes… Read More »

Given a binary tree and two nodes a and b, the task is to print the minimum and the maximum node value that lies in… Read More »

Given a Complete Binary Tree as an array, the task is to print all of its levels in sorted order. Examples: Input: arr[] = {7,… Read More »

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 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 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 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 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 a Binary Tree, the task is to print the Reverse zigzag Order of the tree. Examples: Input: 1 / \ 2 3 / \… Read More »

Given a Binary tree, print all the leaf nodes of a Binary tree at a given level L. Examples: Input: 1 / \ 2 3… Read More »