Depth-First Search (DFS): An algorithm that explores as far as possible along each branch before backtracking. It is often used for traversing trees or graphs.
Breadth-First Search (BFS): An algorithm that explores all the vertices of a graph at the same level before moving on to the next level. It is commonly used for finding shortest paths.
In-order traversal: A type of traversal specifically used for binary trees where nodes are visited in ascending order based on their values.