In-Order Traversal category - Data Structure

Q.  Which among the following belongs to the category of an In-Order Traversal?
- Published on 25 Aug 15

a. Root -> Left Sub Tree -> Right Sub Tree
b. Root -> Right Sub Tree -> Left Sub Tree
c. Right Sub Tree -> Left Sub Tree ->Root
d. Left Sub Tree -> Root -> Right Sub Tree

ANSWER: Left Sub Tree -> Root -> Right Sub Tree

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 21 Nov 15
    In-Order Traversal in Binary Search Tree gives the ascending order of keys.
    In-Order Traversal is:
    Left Sub Tree → Root → Right Sub Tree

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲