50 votes 50 votes 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 $SQPTRWUV$ $SQPTUWRV$ $SQPTWUVR$ $SQPTRUWV$ DS gatecse-2014-set3 data-structures tree easy + – go_editor asked Sep 28, 2014 • edited Jun 29, 2019 by Lakshman Bhaiya go_editor 16.6k views answer comment Share Follow See all 11 Comments See all 11 11 Comments reply Show 8 previous comments VYAN_jy commented Nov 7, 2021 reply Follow Share ill formed question I must say. 2 votes 2 votes samir757 commented Dec 25, 2021 reply Follow Share For detailed explanation of the question , refer to the video below https://www.youtube.com/watch?v=XjggSKsOoes 3 votes 3 votes Shaikh727 commented Jul 29, 2022 reply Follow Share Thank you 0 votes 0 votes Please log in or register to add a comment.
–2 votes –2 votes OPTION C IS RIGHT alifaraz answered Jan 15, 2017 alifaraz comment Share Follow See all 3 Comments See all 3 3 Comments reply Sandeep Suri commented Jan 20, 2017 reply Follow Share Answer is option A). You are doing some mistake. Please check one more time. 1 votes 1 votes shivam gateatzeal commented Jan 23, 2021 reply Follow Share what should we follow in case of 4 childern 0 votes 0 votes Ali Faraz Zaidi commented Jan 24, 2021 reply Follow Share Left->Root->sibling1->sibling2->Right 0 votes 0 votes Please log in or register to add a comment.
