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

Rounding, i need somehelp i am not the sharpest in the pack so plz help me ...

i need somehelp i am not the sharpest in the pack so plz help me thank you i hope you do

Example of hcf, Example  Find the Highest Common Factor of 54, 72...

Example  Find the Highest Common Factor of 54, 72 and 150. First we consider 54 and 72. The HCF for these two quantities is calculated as follows:

Algebraic word problems, Algebraic Word Problems: Equations: 1....

Algebraic Word Problems: Equations: 1. The total electrical output of one nuclear facility is 200 megawatts more than that of another nuclear facility. Let L be the

Division, why 0 is put in quotient while dividing a number

why 0 is put in quotient while dividing a number

Solution of rectilinear figures, A tower and a monument stand on a level pl...

A tower and a monument stand on a level plane. the angles of depression on top and bottom of the monument viewed from the top of the tower are 13 degrees and 31 degrees, respective

Tests for relative minimum, Tests for relative minimum For a relative ...

Tests for relative minimum For a relative minimum point there are two tests: i.The first derivative, which is (dy)/(dx)  = f´(x) = 0 ii.The second derivative, which i

Prove that x2 + y2 - 8x - 10y +39 = 0, If the points (5, 4) and (x, y) are ...

If the points (5, 4) and (x, y) are equidistant from the point (4, 5), prove that x 2 + y 2 - 8x - 10y +39 = 0. Ans :   AP = PB AP 2 = PB 2 (5 - 4) 2 + (4 - 5) 2 = (x

upper and lower limits, A critical dimension of the service quality of a c...

A critical dimension of the service quality of a call center is the wait time of a caller to get to a sales representative. Periodically, random samples of 6 customer calls are mea

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