## Array:

- Store homogenous elements.
- Store in contiguous locations.
- Fixed size not dynamic.
- Complexities
- Accessing O(1)
- Insertion and deletion O(n) worst case
- Searching O(n) sequential | O(nlogn) is sorted

**LinkedList**

- Every entry is an object store data and reference of next object.
- Single LL
- Every node store reference of next node and last node NULL.

- Double LL
- Every node have one reference of next node and another reference of previous node.
- Can traverse in both direction.
- Last node next is having reference as NULL.

- Circular LL
- Form Cycle when all node connected.
- Last Node dont have reference NULL.

- Complexities
- Insertion And Deletion O(1)
- Access O(n)
- Searching O(n)

**Stack**

- Last In First Out
- Two Core Principal : Push() & Pop()
- Complexity
- Insertion And Deletion O(1)
- Accessing O(n)

**Queue**

- First In First Out
- Two Core Principal: Enqueue and Dequeue
- Complexity
- Insertion And Deletion O(1)
- Accessing O(n)

Advertisements

There’s a secret about your post. ICKTTTIHYBY

LikeLike

Great points altogether, you just won a brand new reader. What would you recommend in regards to your submit that you simply made a few days in the past? Any positive?

LikeLike