Yaushe ya kamata ku yi amfani da stack gida da queue? Bada ainihin misalai.

Question

Accepted Answer

Duka biyu sune linear ADTs tare da O(1) a gida, amma **tsarin cirewa** ya sabani: **stack shine LIFO** (sabon kwata kwata a farko), **queue shine FIFO** (tsohon kwata a farko). Daidaita gida ga tsarin da matsalarka ke bukatarwa.

## Bambancin gida

```text
Stack (LIFO):  push 1,2,3  -> pop order 3,2,1
Queue (FIFO):  enq  1,2,3  -> deq order 1,2,3
```

## Ainihin misalai

| Yi amfani da STACK lokacin da... | Yi amfani da QUEUE lokacin da... |
|---|---|
| Cire/sake aiki (aiki sabon kwata a farko) | Tsari aiki (tsari iso) |
| Bugi sakowa na bincike | Shakatawa bugu / jerin aiki |
| Kira aiki/maimaita | BFS / mafi taƙaitaccen hanya akan zane |
| Daidaitawa da maƙallaci, parse | Damje saƙo tsakanin ayyuka |
| DFS (bincika zurfafa a farko) | Iyakance ƙima / kulawa da bukami |

## Karni code

```python
# DFS uses a stack: explore newest branch first
stack = [start]
while stack:
    node = stack.pop()        # LIFO -> goes deep
    for nb in graph[node]: stack.append(nb)

# BFS uses a queue: explore nearest first
from collections import deque
q = deque([start])
while q:
    node = q.popleft()        # FIFO -> goes level by level
    for nb in graph[node]: q.append(nb)
```

## Me yasa ya mahalaci

Zabun LIFO-vs-FIFO yana canza jiya halin algorithm: zarafi graph gida a gida ya zama DFS tare da stack ko BFS tare da queue.

Gane ko matsalarka ke bukatar "sabon kwata" ko "tsohon kwata a farko" kai tsaye yana jaranta ka ga gida daidai.

Cire/sake aiki (aiki sabon kwata a farko)	Tsari aiki (tsari iso)
Bugi sakowa na bincike	Shakatawa bugu / jerin aiki
Kira aiki/maimaita	BFS / mafi taƙaitaccen hanya akan zane
Daidaitawa da maƙallaci, parse	Damje saƙo tsakanin ayyuka
DFS (bincika zurfafa a farko)	Iyakance ƙima / kulawa da bukami