Inorder traversal, Data Structure & Algorithms

Assignment Help:

Inorder traversal: The left sub tree is visited, then the node and then right sub-tree.

Algorithm for inorder traversal is following:

  1. traverse left sub-tree
  2. visit node
  3. traverse right sub-tree

2209_Inorder traversal.png

Figure: An expression tree: An inorder traversal

Inorder traversal can be best explained by an expression tree, where the operators are at parent node & operands are at leaf nodes.

Let us assume the above expression tree .The postorder , preorder, and inorder traversal are following:

preorder Traversal :  + * / 4 2 7 - 3 1

 postorder traversal :  4 2 / 7 * 3 1 - +

inorder traversal    :  - ((((4 / 2) * 7) + (3 - 1))

 

There is another tree traversal (certainly, not very common) is called level order, where all the nodes of the similar level are first travelled starting from the root .

271_Inorder traversal1.png

Figure: Tree Traversal: Level Order


Related Discussions:- Inorder traversal

State the ruby programming language, The Ruby Programming Language Alth...

The Ruby Programming Language Although data structures and algorithms we study aren't tied to any program or programming language, we need to write particular programs in speci

Binary search, Explain binary search with an example

Explain binary search with an example

How conquer technique can be applied to binary trees, How divide and conque...

How divide and conquer technique can be applied to binary trees?  As the binary tree definition itself separates a binary tree into two smaller structures of the similar type,

Asymptotic notation.., important points on asymptotic notation to remember

important points on asymptotic notation to remember

Find error for curious number, #include #include int sumFact(int numb);...

#include #include int sumFact(int numb); int calculateFactorial(int digit); main() { int numb, sumfact; do{ printf ("Enter a number 1 to 9999\n"); scanf("%

Optimization Methods, Optimal solution to the problem given below. Obtain t...

Optimal solution to the problem given below. Obtain the initial solution by VAM Ware houses Stores Availibility I II III IV A 5 1 3 3 34 B 3 3 5 4 15 C 6 4 4 3 12 D 4 –1 4 2 19 Re

Four applications or implementation of the stack, Q. Write down any four ap...

Q. Write down any four applications or implementation of the stack.                                     Ans. (i)       The Conversion of infix to postfix form (ii)

Data structures, #quCreate a flowchart to show the process that will allow ...

#quCreate a flowchart to show the process that will allow the implementation of Queue, Enqueue, and Dequeue operations.estion..

Algorithm of decorated graph, As we talked in class, a program with two int...

As we talked in class, a program with two integer variables is universal. Now, we consider a special form of four variableprograms. Let G = (V; E) be a directed graph, where V is a

Determine the components of illumination, Determine the Components of Illum...

Determine the Components of Illumination The light reaching the eye when looking at a surface has clearly come from a source (or sources) of illumination and bounced off the su

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd