b) Describe an algorithm that decides, given any two binary trees T, and T2, whether the tree T, equals a subtree of the tree T,. For example, in the diagram shown below, the top two trees illustrate...

Extracted text: b) Describe an algorithm that decides, given any two binary trees T, and T2, whether the tree T, equals a subtree of the tree T,. For example, in the diagram shown below, the top two trees illustrate the scenario where the tree T, is a subtree of the binary tree T,; the bottom two diagrams illustrate the scenario where the tree T, is NOT a subtree of the binary tree T,. 10 11 TE Ooted at 6 Tree T2 The tree T1 rooted at 6 isa subtree af t.he binary tree T2 that is rooted at . 2 10 11 Tree T1 root ed at Tree T2 The tree TI rootd at. 6 ia a NOT a subtree of the binary tre 12 that ia ziciated at 4.