2 Write Algorithm Accepts Three Nodes Binary Search Tree U V Element Place Two Children V Q37029868

2. Write your own algorithm that accepts three nodes from a binary search tree: u, v and element in its place that has two children: v(and its whole subtree) and w(and its whole TRANSPLANT. You might visualize this w. The algorithm should get rid of element u (and its whole subtree) and put in a new subtree). (This is like a fancy TRANSPLANT(T,u,v).) Do not assume that you have as: Show transcribed image

OR

 

OR