Question: Disadvantages of linked list representation of binary trees over arrays?

Options

A : Randomly accessing is not possible

B : Extra memory for a pointer is needed with every element in the list

C : Difficulty in deletion

D : Random access is not possible and extra memory with every element

Click to view Correct Answer

Previous || Next

Data Structure Binary Trees Linked Lists more questions

TRNGs take in an input which is referred to as

Which of the following can be used for random number....

Which of the following approach should be used if you....

Which among on the following transceiver parameter may be used....

Elements in an array are accessed _____________

In the bootstrap method, the data are resampled by _____....

The shotgun approach _______ sequences clones from _____ of cloned....

Entropy is the measure of

To what kind of elements does non-modifying sequence algorithm can....

Bandwidth is :

Data Structure Adjacency List more Online Exam Quiz

Data Structure Binary Heap

Data Structure Binary Search Iterative

Data Structure Binary Search Tree

Data Structure Binary Tree Properties

Data Structure Binary Trees Array

Data Structure Binomial Fibonacci Heap

Data Structure Bit Array

Data Structure Breadth First Search

Data Structure Bubble Sort

Data Structure Campus Interviews