Category: algorithms

Self-tutoring about computer science: the tutor mentions breadth-first search. Let’s imagine you want to search for a book in your three-room apartment. In a breadth-first search (BFS), you’d plan to peek in each room in case it’s lying out where …

Computer science: breadth-first search Read more »

Self-tutoring about comp sci and internet resources: the tutor mentions a discovery. The right resource is key to solving a problem. Finding a good one, therefore, can be crucial. This morning, researching the non-recursive inorder traversal idea, I found a …

Comp sci: non-recursive inorder traversal: a resource Read more »