Tree Traversals

110+ posts

Similar Topics

DSA

21k+ articles

Mathematical

7.6k+ articles

Searching

1.6k+ articles

Tree

1.3k+ articles

Recursion

980+ articles

Data Structures

800+ articles

DFS

350+ articles

Queue

340+ articles

Binary Tree

330+ articles

tree-level-order

120+ articles

Binary Tree Iterator for Inorder Traversal

Last Updated: 20 February 2023

Given a Binary Tree and an input array. The task is to create an Iterator that utilizes next() and hasNext() functions to perform Inorder traversal on the binary tree.Exam ...read more

Height and Depth of a node in a Binary Tree

Last Updated: 25 September 2023

Given a Binary Tree consisting of N nodes and a integer K, the task is to find the depth and height of the node with value K in the Binary Tree.The depth of a node is the ...read more

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

Create a mirror tree from the given binary tree

Last Updated: 26 March 2023

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: 5 / \ 3 6 / \ 2 ...read more

Print path between any two nodes in a Binary Tree

Last Updated: 08 September 2022

Given a Binary Tree of distinct nodes and a pair of nodes. The task is to find and print the path between the two given nodes in the binary tree.For Example, in the above ...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

Preorder Traversal of N-ary Tree Without Recursion

Last Updated: 24 October 2022

Given an n-ary tree, print preorder traversal of it.Example :Preorder traversal of below tree is A B K N M J F D G E C H I LThe idea is to use stack like iterative preorde...read more

Preorder from Inorder and Postorder traversals

Last Updated: 18 January 2023

Given Inorder and Postorder traversals of a binary tree, print Preorder traversal.Example:Input: Postorder traversal post[] = {4, 5, 2, 6, 3, 1} Inorder traversal in...read more

Print nodes in top view of Binary Tree | Set 2

Last Updated: 13 April 2023

Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, print the top view of it. The output nodes should be print ...read more

Check if given Preorder, Inorder and Postorder traversals are of same tree

Last Updated: 06 October 2023

Given Preorder, Inorder, and Postorder traversals of some tree. Write a program to check if they all are of the same tree.Examples:Input : Inorder - 4 2 5 1 3 Preor ...read more

Check if two nodes are cousins in a Binary Tree

Last Updated: 23 June 2022

Given the binary Tree and the two nodes say 'a' and 'b', determine whether the two nodes are cousins of each other or not.Two nodes are cousins of each other if they are a ...read more

Data Structures | Tree Traversals | Question 4

Last Updated: 28 June 2021

What does the following function do for a given binary tree?[sourcecode language="C"]int fun(struct node *root){ if (root == NULL) return 0; if (root-left == NULL ...read more

Data Structures

Data Structures-Tree Traversals

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>