## Iterative Postorder traversal | Set 3

We have seen different ways of performing postorder traversal on Binary Trees. Post Order Traversal. Iterative Postorder Traversal using Two Stacks. Iterative Postorder Traversal using… Read More »

- MakeMyTrip Interview Experience 2019
- Print the nodes of binary tree as they become the leaf node
- Iterative Method To Print Left View of a Binary Tree
- Shannon-Fano Algorithm for Data Compression
- Count the Number of Binary Search Trees present in a Binary Tree
- Flatten a binary tree into linked list | Set-3
- Zig-Zag traversal of a Binary Tree using Recursion
- Difference between graph and tree
- Shortest root to leaf path sum equal to a given number
- Remove minimum elements from either side such that 2*min becomes more than max | Set 2
- Clockwise Spiral Traversal of Binary Tree
- Reverse zigzag Traversal of a Binary Tree
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Number of subarrays have bitwise OR >= K
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Iterative Boundary traversal of Complete Binary tree
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Reverse Level Order traversal in spiral form
- Find the number of distinct pairs of vertices which have a distance of exactly k in a tree
- Building Expression tree from Prefix Expression
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Sum of all odd nodes in the path connecting two given nodes
- Print all the levels with odd and even number of nodes in it | Set-2
- Range Sum Queries and Update with Square Root
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
- Sum of all the Boundary Nodes of a Binary Tree
- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Distribute candies in a Binary Tree
- Determine the count of Leaf nodes in an N-ary tree

We have seen different ways of performing postorder traversal on Binary Trees. Post Order Traversal. Iterative Postorder Traversal using Two Stacks. Iterative Postorder Traversal using… Read More »

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

Given an n-ary tree and Q queries where each query consists of an integer u which denotes a node. The task is to print the… Read More »

Given a Binary Search Tree and an integer sum, the task is to find all the pairs from the tree whose sum is equal to… Read More »

Given a binary tree, target node X and a string patt. The task is to find the last node of the binary tree following the… Read More »

Given a Binary Tree, the task is to find the absolute difference between the sums of odd and even positioned nodes. A node is said… Read More »

Given a binary tree, find the sum of all parent-child differences for all the non-leaf nodes of the given binary tree. Note that parent-child difference… Read More »

Given a binary tree, print even positioned nodes of even level in level order traversal. The root is considered at level 0, and the left… Read More »

Given a Binary Tree having positive and negative nodes, the task is to find the maximum sum of non-leaf nodes among all level of given… Read More »

Given a Binary Tree having positive and negative nodes, the task is to find the maximum sum of leaf nodes among all level of the… Read More »

Given a tree, and the weights of all the nodes and an integer x, the task is to find a node i such that weight[i]… Read More »

Given a tree with N nodes which initially have no color and an array color[] of size N which represent the color of each node… Read More »

Given an array arr[] of N integers and queries Q. Queries are of two types: Update a given index ind by X. Find the gcd… Read More »

Given a Binary Tree, where each node contains an extra empty pointer initially null. The task is to connect all nodes of the binary tree… Read More »

Given a binary tree containing n nodes. The task is to find the sum of all the leaf nodes present at maximum level. Examples: Input:… Read More »