1 votes 1 votes The inorder traversal of the following tree is $2 \, \, \, 3 \, \, \, 4 \, \, \, 6 \, \, \, 7 \, \, \, 13 \, \, \, 15 \, \, \, 17 \, \, \, 18 \, \, \, 18 \, \, \, 20$ $20 \, \, \, 18 \, \, \, 18 \, \, \, 17 \, \, \, 15 \, \, \, 13 \, \, \, 7 \, \, \, 6 \, \, \, 4 \, \, \, 3 \, \, \, 2$ $15 \, \, \, 13 \, \, \, 20 \, \, \, 4 \, \, \, 7 \, \, \, 17 \, \, \, 18 \, \, \, 2 \, \, \, 3 \, \, \, 6 \, \, \, 18$ $2 \, \, \, 4 \, \, \, 3 \, \, \, 13 \, \, \, 7 \, \, \, 6 \, \, \, 15 \, \, \, 17 \, \, \, 20 \, \, \, 18 \, \, \, 18$ DS ugcnetcse-dec2015-paper2 data-structures tree-traversal + – Sankaranarayanan P.N asked Aug 2, 2016 edited Nov 20, 2022 by gatecse Sankaranarayanan P.N 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes 2 4 3 13 7 6 15 17 20 18 18 left - node - right is the order of inorder traversal if it was binary search tree inorder traversal is easy to write - in order traversal of binary search tree give the nodes in ascending order Sankaranarayanan P.N answered Aug 2, 2016 selected Nov 26, 2016 by Sanjay Sharma Sankaranarayanan P.N comment Share Follow See all 0 reply Please log in or register to add a comment.