Question

C++

For the followin gequations draw the binary tree and show the output through the required traversal methods.

1. a+b[pre-order]

2. a-(b*c)[in-order]

3) (a<b) or (c<d) [post-order]

4) x: =(-b+(b^2-4*a*c)^0.5)/(2*a) [in-order]

Answer 1

1.

• In Preorder, first, the root is visited, then the left subtree is traversed and then the right subtree. So, "a" should be the left subtree and "b" should be the right subtree and "+" will be the root.

2.

• In order traversal, first, the left subtree is traversed, then the root is traversed and then the right subtree is traversed.
• So, in this "a" should be in the left subtree and "b*c" should be in the right subtree and after the computation of "b*c", it will be subtracted from the left subtree.
  

3.

• In post order, first, the left subtree is computed, then the right subtree is computed and after that with the help of root, the left and right results are computed.
• So, in this case, "a <b" becomes the left subtree and "c<d" becomes the right subtree of "or".
  

4.

• In order traversal, first, the left subtree is traversed, then the root is traversed and then the right subtree is traversed.
  

Friend, this was a really nice question to answer. If you find my answer helpful, please like it. Thanks.