TRUE
FALSE
array
link list
tree
all of the above
Tell whether the following tree is:
Heap
Full and Complete
Heap Complete
None of the above
Tree
Array
Linked list
Queue
Last In First Out (LIFO)
First In Last Out (FILO)
First In First Out (FIFO)
Last In Last Out (LILO)
Linked list is an example of linear data structure
Insertion and deletion of an element can be done at any position in a linked list
Linked list can be used to store a collection of homogenous and heterogeneous data types
The size of a linked list is fixed
First in first out
First in last out
Last in first out
Last in last out
Singly-linked list
Doubly-linked list
Circular-linked list
None of These
We can traverse in both the directions.
It requires extra space
Implementation of doubly linked list is easier than the singly linked list
It stores the addresses of the next and the previous node
