Describe how to clone a LinkedBinaryTree instance representing a (not necessarily proper) binary tree, with use of the add _left and add _right methods.   Give an efficient algorithm that computes and...

Describe how to clone a LinkedBinaryTree instance representing a (not

necessarily proper) binary tree, with use of the add _left and add _right

methods.

Give an efficient algorithm that computes and prints, for every position
p

of a tree
T, the element of
p
followed by the height of
p’s subtree.

Give an
O(n)-time algorithm for computing the depths of all positions of

a tree
T, where
n
is the number of nodes of
T.