Menene nau'in data na gaje (ADT) kuma me ya sa aka kewarewa shi daga iyaka sa?

Question

Accepted Answer

Nau'in data na gaje** ya bayyana saitin ƙima da **ayyukan** da ake ba da izini a kan su, wanda aka kwatanta ta hanyar **hali** — ba ta lambar ba. Gyara shine tsarin kaolin (array, linked list, tree) wanda yake haifar da wannan hali.

## ADT daidai, gyara daban-daban

```text
ADT "Queue":  enqueue, dequeue, peek  (FIFO contract)

Implementation A: array + two indices (ring buffer)
Implementation B: doubly linked list with head/tail pointers
Both honor the SAME contract; cost profiles differ.
```

## Me ya sa a kewarewa su

```python
# Callers depend on the CONTRACT, not the internals
class Stack:
    def push(self, x): ...
    def pop(self): ...
    def peek(self): ...
# Swap a list for a linked list internally — callers never change.
```

## ADTs na jari da jarin iyaka

| ADT | Jarin iyaka |
|---|---|
| List | dynamic array, linked list |
| Stack | array, linked list |
| Queue | ring buffer, linked list |
| Map | hash table, balanced tree |
| Priority Queue | binary heap |

## Me ya sa yana da mahimmanci

Rubutu zuwa ADT (abin da aka saba) kyauta kodaki: kana iya inganta iyaka daga gida ba tare da karya kira ba.

Ya kuma fayyace tunanin — ka yanke shawarar *hali* da kake bukata da farko, sannan zaɓi isunan raunin da ke bayarwa.

ADT	Jarin iyaka
List	dynamic array, linked list
Stack	array, linked list
Queue	ring buffer, linked list
Map	hash table, balanced tree
Priority Queue	binary heap