(a) A binary tree is given with the sequential storage representation. Write the program/algorithm
to copy the binary tree into linked storage representation.
Answers
Answered by
1
Answer:
Binary trees in linked representation are stored in the memory as linked lists. These lists have nodes that aren't stored at adjacent or neighboring memory locations and are linked to each other through the parent-child relationship associated with trees. In this representation, each node has three different parts
Similar questions