How do you traverse a binary tree, Mathematics

Assignment Help:

How do you traverse a Binary Tree?  Describe Preorder, Inorder and Postorder traversals with example.    

Ans: Traversal of tree means tree searching for a aim. The aim may be for searching or sorting of the items consisted of in a tree. A tree may consist of an item at its node as a label.

Traversing a tree is a recursive process. 

1764_How do you traverse a Binary Tree.png

To apply this, a tree is considered to comprise three components: root, left subtree and right subtree. These three components can be in order in six different ways: (left, root, right), (root, left, right), (left, right, root), (right, left, root), (right, root, left) and (root, right, left). The first three are used while the last three combinations are of no make use of as it alters the positions of a node in a positional tree.

Inorder Traversal: In this type of traversal, a tree is traversed in the sequence: Left subtree, Root, Right subtree.   

In the above expression, start at the root node marked, +. As first we have to traverse its left subtree, thus move to the root of left subtree that is node marked, *. Once again it has a left subtree with root node marked +, visit it. This subtree has a node labeled 3 that has no left subtree, thus out put 3. Then root of this subtree that is '+' and then right subtree which is once again a node labeled with 4, so output it. So we have expression acquired till here is 3 + 4.

Proceeding this way we acquire (3+4)*(5-2) + (-5). Parentheses signify both precedence and portion of the sub tree to which this sub-expression corresponds.     

Preorder Traversal: In this type of traversal a tree is traversed in the sequence: Root, Left subtree, Right subtree. Apply the algorithm recursively till all nodes have been visited, we acquire + * + 3 4 - 5 2 -5. 

Postorder Traversal: In this type of traversal a tree is traversed in the sequence: Left subtree, Right subtree, Root. We acquire 3 4 + 5 2 - * 5 - +.


Related Discussions:- How do you traverse a binary tree

Discret math, i have a question about discret math

i have a question about discret math

Divison, what is 24 diveded by 3

what is 24 diveded by 3

Group automorphism, (a) Find an example of groups G, H, K with K  H and H...

(a) Find an example of groups G, H, K with K  H and H G but K G. (b) A subgroup H of G is characteristic if σ(H) ⊆ H for every group automorphism σ of G. Show that eve

Mean is 8.32 find the median, In a frequency distribution mode is 7.88, mea...

In a frequency distribution mode is 7.88, mean is 8.32 find the median.  (Ans: 8.17) Ans:  Mode = 3 median - 2 mean 7.88 = 3 median - 2 x 8.32 7.88 +16.64 = 3 median

Invariant lines, What lines are invariant under the transformation [(103)(0...

What lines are invariant under the transformation [(103)(01-4)(001)]? I do not know where to even begin to solve this. Please help!!

Example of inflection point-differential equation, Example of inflection po...

Example of inflection point Determine the points of inflection on the curve of the function y = x 3 Solution The only possible inflexion points will happen where

Simple interest, find the simple interest on Rs. 68,000 at 50/3 per annum f...

find the simple interest on Rs. 68,000 at 50/3 per annum for 9 month

What is minimum spanning tree, What is minimum spanning tree?  Determine a ...

What is minimum spanning tree?  Determine a railway network of minimal cost for the cities in the following graph using Kruskal's algorithm. Ans: Minimum spanning tree in a con

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