Search tree creation uses the same double-ended queue (DEQ) as the graph search operation.

Search trees can therefore be created in either a breadth-first or depth-first manner.

For both breadth-first and depth-first search, the time taken to construct the tree is proportional to the tree's size: O(b^d)