Advertisements
Advertisements
Question
With suitable example explain how tree can be represented in Memory?
Short Note
Solution
The above tree can be represented in memory as,
The roots stores of first node of tree T.
AVAIL stores address of first null node. To insert another node to tree T, it is inserted memory location pointed by AVAIL.
shaalaa.com
Basic Data Structures (Stack, Queue, Dequeue)
Is there an error in this question or solution?