## Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )

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 appear… 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
- Shannon-Fano Algorithm for Data Compression
- Find the node with maximum value in a Binary Search Tree
- Iterative Method To Print Left View of a Binary Tree
- Print path between any two nodes in a Binary Tree
- Search a node in Binary Tree
- Print all even nodes of Binary Search Tree
- Flatten a binary tree into linked list | Set-3
- Zig-Zag traversal of a Binary Tree using Recursion
- Shortest root to leaf path sum equal to a given number
- Difference between graph and tree
- Print all nodes between two given levels in Binary Tree
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Clockwise Spiral Traversal of Binary Tree
- Some Basic Theorems on Trees
- Check whether a given binary tree is skewed binary tree or not?
- Number of subarrays have bitwise OR >= K
- Reverse zigzag Traversal of a Binary Tree
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Counting inversions in an array using segment tree
- Iterative Boundary traversal of Complete Binary tree
- Sum of all odd nodes in the path connecting two given nodes
- Sum and Product of minimum and maximum element of Binary Search Tree
- Building Expression tree from Prefix Expression
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Range Sum Queries and Update with Square Root
- Maximum number of leaf nodes that can be visited within the given budget
- Print all the levels with odd and even number of nodes in it | Set-2

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 appear… 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 »

Given a Binary tree, the task is to print all the internal nodes in a tree. An internal node is a node which carries at… 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 the value of ‘N’ and ‘I’. Here, represents the number of internal nodes present in an N-ary tree and every node of the N-ary… 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 »

Given an integer N, the task is to construct a tree such that sum of for all ordered pairs (u, v) is maximum where u… Read More »

Given a binary tree with N nodes, in which each node value represents number of candies present at that node, and there are N candies… Read More »

Given a Binary Tree, print it’s left view. Left view of a Binary Tree is a set of nodes visible when tree is seen from… Read More »

Given a binary tree, the task is to print the sum of all the boundary nodes of the tree. Examples: Input: 1 / \ 2… Read More »

Given a root node to a tree, find the sum of all the leaf nodes which are at maximum depth from root node. Example: 1… Read More »