ALGORITHM:

Recursion on Binary Trees: The input is a binary tree T with an integer valued key per node. Design & analyze efficient recursive algorithms for the following task

Find a pair of nodes (x, y) in T such that

(i) y is the successor of x in the inorder sequence of nodes of T, and

(ii) | (depth of x)(depth of y) | is maximum possible.