AXC 8. Write a.method that. takes two binary trees t1, t2 and a blnary tree node v as the arguments. It constructs and returns a new blnary tree that has v as Its root and whose left subtree Is tl and...

Algorithm

In addition, write a paragraph about solution strategy.

please explain your solution without any plagiarism

Extracted text: AXC 8. Write a.method that. takes two binary trees t1, t2 and a blnary tree node v as the arguments. It constructs and returns a new blnary tree that has v as Its root and whose left subtree Is tl and whose .right subtree Is tz. Both t1 and tz should be empty on completlon of the execution.