We say that a binary search tree T 1 can be right converted to binary search tree T 2 if it is possible to obtain T 2 from T 1 via a series of calls to RIGHT ROTATE Give an example of two trees T 1 and T 2 such that T 1 cannot be right converted to T 2 Then, show that if a tree T 1 can be right con...

A good counterexample is that T112 T221 T1 cannot be rotated ri ...

We say that a binary search tree T 1 can be right-converted to binary search tree T

Question:

We say that a binary search tree T₁ can be right-converted to binary search tree T₂ if it is possible to obtain T₂ from T₁ via a series of calls to RIGHT-ROTATE. Give an example of two trees T₁ and T₂ such that T₁ cannot be right-converted to T₂. Then, show that if a tree T₁ can be right-converted to T₂, it can be right-converted using O(n²) calls to RIGHT-ROTATE.