Q about Problem 19-2 in "Lisp" by Winston and Horn
Problem 19-2 in "Lisp" by Winston and Horn states, In depth-first search, all of the partial paths in the queue at a given point in the search are related to one another in a simple way: each is the extension by one node of the partial path after it in the queue. The queue might, for example, look like this: ...