2 2 votes The result of performing an inorder search on the given tree is s y x z v u t y s x z v u t s y v u t z x v u t z x y s Data Structures go-alogrithms-1 data-structures binary-tree tree-traversal two-marks + – Bikram 553 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 3 3 votes Inorder traversal : Left --- Root ---- Right y s x z v u t Digvijay Pandey answered Oct 11, 2016 • selected Oct 11, 2016 by Arjun Digvijay Pandey comment Share Follow 0 reply Please log in or register to add a comment.