Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?

  1. Home

Question:Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?

1.Yes just traverse through the array and form the tree

2.No we need one more traversal to form a tree

3.No in case of sparse trees

4.Yes by using both inorder and array elements

Posted by R4R Team
  1. Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!