Write a function that takes in a tree T and a pair of nodes u and v and returns true if u is a child of v and false otherwise.

Java programming 1. Please find the maximum element in a Binary Search Tree?

Create a function that rapidly identifies whether any two nodes u and v in a tree T with s as the root node are ancestors or descendants of each other.

All of the following are true EXCEPT: An empty tree is defined to have a height of 1. The depth of a node p is the number of ancestors of p, other than p itself. The height of a tree to be equal to the maximum of the depths of its nodes (or zero, if the tree is empty). The height of a node p in a tree T: • If p is a leaf, then the height of p is 0. • Otherwise, the height of p is one more than the maximum of the heights of p's children.