Can a tree stored in an array using either one of inorder or post ord – McqOptions

MCQOPTIONS

1.	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
Answer» C. No in case of sparse trees

Discussion

No Comment Found

Related MCQs

Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?
Why is heap implemented using array representations than tree(linked list) representations though both tree representations and heaps have same complexities? Then why go with array representation when both are having same values ?
Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of tree is good?
If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array?
What is the parent for a node ‘w’ of a complete binary tree in an array representation when w is not 0?
What are the children for node ‘w’ of a complete-binary tree in an array representation?
What must be the ideal size of array if the height of tree is ‘l’?
What is/are the disadvantages of implementing tree using normal arrays?
How many children does a binary tree have?
If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array ?