Consider a situation of writing a binary tree into a file...

Home / Data Structure / Binary Search Trees(B Tree) / Question

Examveda

Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of tree is good?

A. yes because we are overcoming the need of pointers and so space efficiency

B. yes because array values are indexable

C. No it is not efficient in case of sparse trees and remaning cases it is fine

D. No linked list representation of tree is only fine

Answer: Option C

Related Questions on Binary Search Trees(B Tree)

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

View Answer

A. Inorder

B. Preorder

C. Postorder

D. Level-order

View Answer

A. 1

B. 2

C. 3

D. Any number

View Answer

A. Verify if all nodes in the left subtree are less than the root and all nodes in the right subtree are greater than the root.

B. Check if the tree is balanced.

C. Ensure all nodes have exactly two children.

D. Verify the height of the tree.

View Answer