Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?
(a) Yes just traverse through the array and form the tree
(b) No we need one more traversal to form a tree
(c) No in case of sparse trees
(d) Yes by using both inorder and array elements
My doubt is from Binary Trees using Array topic in section Binary Trees of Data Structures & Algorithms I
I had been asked this question by my school principal while I was bunking the class.