Q1. There are many algorithms to search for a target node in tree topology. Compare between (a) Breadth First Search (BF
Posted: Wed Apr 27, 2022 3:41 pm
Q1. There are many algorithms to search for a target node in tree topology. Compare between (a) Breadth First Search (BFS), and (b) Depth First Search (DFS) by writing the Pseudocode and examples for both algorithms: (4 points) Pseudocode: Depth-first searching Breadth-first searching Examples: Depth-first searching Breadth-first searching