Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?
Posted: Wed Jul 13, 2022 7:42 pm
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
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