text: # For the following binary tree, inorder traversal yields the expression:
  
  This question was previously asked in
  KVS PGT CS 2017 official paper
  View all KVS Papers >
  1. a + bd* - ef /
  2.  a + b*d - e/f
  3. abdef* / + -
  4. - + * / abdef
  
  Option 2 :  a + b*d - e/f
  Free
  ST 1: General Knowledge
  6174
  20 Questions 20 Marks 20 Mins
  
  ## Detailed Solution
  
  Concept:
  
  In the in-order traversal method, the left subtree is visited first, then the root and then the right subtree. Every node is a subtree in itself.
  
  Explanation:
  
  Given a binary tree :
  
  For this, we first visit the left - subtree of root -.
  
  1) It will first print a. Then root, +  (a + )
  
  2) Then it will go to right subtree, in this again left subtree of root *. It prints b , then * , then d  (a + b * d)
  
  3) Then it print "-".  (a + b * d -)
  
  4) Then move to right subtree. First print e, then /, then f .(e/f)
  
  5) Final output will be :  a + b * d -  e/f