Home » Programming & Data Structure » Programming and data structure miscellaneous » Question

Programming and data structure miscellaneous

Programming & Data Structure

  1. Consider the following rooted tree with the vertex labeled P as the root :

    The order in which the nodes are visited during an in-order traversal of the tree is
    1. SQPTRWUV
    2. SQPTUWRV
    3. SQPTWUVR
    4. SQPTRUWV
Correct Option: A

The in order transversal is as: left, root, middle, right \ Nodes are visited in SQPTRWUV order.



Your comments will be displayed only after manual approval.