Breath first search cannot be used to find converted components of a graph.

Optimal binary search tree construction can be performed efficiently using dynamic programming.

Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe

Depth first search can be used to find connected components of a graph.