State the demerits of linked representation of binary trees?
- 1 Answers
- 1022 Views
- I also Faced
- E-Mail Answers
Answer / Kuvar Sen
1. Inefficient for random access due to the non-contiguous memory allocation of nodes
2. Insertion and deletion operations can be slower because the tree needs to be rebalanced after inserting or deleting a node, especially in AVL trees or red-black trees
3. More memory is required compared to array-based representation due to the overhead for storing pointers
| Is This Answer Correct ? | 0 Yes | 0 No |
Can arraylist have duplicates?
Why is data structure needed?
Can treemap have null values?
Which sorting algorithm is worst?
Explain binary search tree?
How is a hashset implemented?
What is definition list?
What is the most used data structure?
What is the use of space complexity and time complexity?
What is a subtree in data structures?
What are the major data structures used in the rdbms?
In RDBMS, what is the efficient data structure used in the internal storage representation?
Windows 
