Search Strategies
Search Strategies is a search strategy. Say the data structure, whether it uses a heuristic, and if it guarantees a shortest path. Draw a tiny 6-node graph. That is the exam, not a textbook proof.
Search Strategies — output — three exam lines. Graph on paper first.
For Search Strategies — always mark visited nodes or you loop. Say complexity in plain words: time vs memory trade-off.
start
├── BFS queue
├── DFS stack
└── A* g+h
│
▼
goalExam tip
DS + heuristic yes/no + optimality.