State The Merit Of Linked Representation Of Binary Trees?

1.	State The Merit Of Linked Representation Of Binary Trees?
Answer» Insertions and deletions in a NODE involve no data movement except the rearrangement of POINTERS, hence LESS processing TIME. Insertions and deletions in a node involve no data movement except the rearrangement of pointers, hence less processing time.

Answer»

Insertions and deletions in a NODE involve no data movement except the rearrangement of POINTERS, hence LESS processing TIME.

Insertions and deletions in a node involve no data movement except the rearrangement of pointers, hence less processing time.

Discussion