14. Suppose T1 and T2 are binary search trees with respective roots r1 and r2. Given a node u, let LEFT(u) and RIGHT(u) refer to the respective left and right children of u. We say that T1 and T2 are isomorphic if they have the exact same structure (in other words, the drawings of T1 and T2 are the same).