PostOrder Traversal

30+ posts

Similar Topics

20.6k+ articles

1.6k+ articles

1.3k+ articles

970+ articles

810+ articles

320+ articles

110+ articles

80+ articles

40+ articles

40+ articles

Preorder, Postorder and Inorder Traversal of a Binary Tree using a single Stack

Last Updated: 18 January 2022

Given a binary tree, the task is to print all the nodes of the binary tree in Pre-order, Post-order, and In-order iteratively using only one stack traversal.Examples:Input...read more

Find maximum matching in a given Binary Tree

Last Updated: 28 February 2023

Given a Tree with N nodes values from 1 to N and N - 1 edges. The task is to find the maximum matching in the given tree.A matching in a tree is a collection of edges such...read more

Post Order Traversal of Binary Tree in O(N) using O(1) space

Last Updated: 25 October 2021

Prerequisites:- Morris Inorder Traversal, Tree Traversals (Inorder, Preorder and Postorder)Given a Binary Tree, the task is to print the elements in post order using O(N) ...read more

Tree

Inorder Traversal

PostOrder Traversal

interview-preparation

Find parent of given node in a Binary Tree with given postorder traversal

Last Updated: 15 March 2023

Given two integers N and K where N denotes the height of a binary tree, the task is to find the parent of the node with value K in a binary tree whose postorder traversal ...read more

Iterative Postorder Traversal of N-ary Tree

Last Updated: 30 December 2022

Given an N-ary tree, the task is to find the post-order traversal of the given tree iteratively.Examples:Input: 1 / | \ 3 2 4 / \5 6Output: [5, 6, 3, 2, 4, 1]In ...read more

Iterative Postorder traversal | Set 3

Last Updated: 02 November 2021

We have seen different ways of performing postorder traversal on Binary Trees.Post Order Traversal.Iterative Postorder Traversal using Two Stacks.Iterative Postorder Trave...read more

DFS traversal of a Tree

Last Updated: 30 May 2023

Given a Binary tree, Traverse it using DFS using recursion.Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to trave...read more

Arithmetic Expression Evaluation

Last Updated: 19 June 2023

The stack organization is very effective in evaluating arithmetic expressions. Expressions are usually represented in what is known as Infix notation, in which each operat...read more

Data Structures-Stack

expression-evaluation

Parentheses-Problems

DSA

Find postorder traversal of BST from preorder traversal

Last Updated: 22 August 2022

Given an array representing preorder traversal of BST, print its postorder traversal.Examples:Input : 40 30 35 80 100Output : 35 30 100 80 40Input : 40 30 32 35 80 90 100 ...read more

Find n-th node in Postorder traversal of a Binary Tree

Last Updated: 28 February 2023

Given a Binary tree and a number N, write a program to find the N-th node in the Postorder traversal of the given Binary tree.Prerequisite: Tree TraversalExamples:Input : ...read more

Postorder successor of a Node in Binary Tree

Last Updated: 18 August 2022

Given a binary tree and a node in the binary tree, find Postorder successor of the given node.Examples: Consider the following binary tree 20 ...read more

Tree Traversal Techniques - Data Structure and Algorithm Tutorials

Last Updated: 23 June 2023

Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways.A Tree D...read more

1 2 3 >>

1 2 3 >>

1 2 3 >>