img
Question:
Published on: 23 January, 2022

What is tree traversal?

Answer:

Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree −

  • In-order Traversal
  • Pre-order Traversal
  • Post-order Traversal

See the below image of a binary search tree, and traverse it using all available methods −

  • In-order traversal − 10 14 19 27 31 35 42
  • Pre-order traversal − 27 14 10 19 35 31 42
  • Post-order traversal − 10 19 14 31 42 35 27
Subjects
Mobile computing Design and Analysis of Algorithm Database Management System C Programming and Practices Computer Graphics and Multimedia Software Engineering
Trending

Write the recursive algorithm to find x^ n.
View : 7
27 May, 2022

What operations can be performed on Queues?
View : 30
23 January, 2022

Write a C language function to find the in-order successor of the root of a binary tree.
View : 31
21 January, 2022

Convert the following infix expression Into equivalent postfix expression using stack.

\( {* C-(D-E)/(F+ G)}\)

What is dequeue?
View : 56
23 January, 2022

What is a self referential structure? What is difference between Union & Structure?
View : 4
27 May, 2022
Random questions
About
MindStudy is a preparation hub for all the students. The goal is to make it easier for pupils to get better grades on exams. We have a list of questions with the best answer for each. Professors, Teachers, and Faculty members from a variety of universities, schools, and institutions throughout the world prepare the Q&A.
Contacts
Shunya Intelliware Solution
Kolkata, WB
Mail us at: info@mindstudy.in

Follow us on:
Streams
Top Subjects
Data Structures & Algorithm Database Management System Software Engineering Compiler Design Mobile computing Design and Analysis of Algorithm C Programming and Practices Computer Graphics and Multimedia
MindStudy © Copyright 2022, All rights reserved.
Home About Contact