The Hausdorff distance is a relatively new measure of similarity graphs. notion the considers special kind common subgraph compared graphs and depends on structural properties outside subgraph. There was no known efficient algorithm for problem determining between two trees, in this paper we present polynomial-time it. recursive it utilizes divide conquer technique. As subtask also uses procedu...