Question

What is the advantage of sequtial representatiin of binary tree?

Answer 1

This approach, known as a sequential tree representation, has the advantage of saving space because no pointers are stored. It has the disadvantage that accessing any node in the tree requires sequentially processing all nodes that appear before it in the node list.