Trees. A regular binary tree is a binary tree whose internal nodes have two subtrees, a left subtree and a right subtree. 3. Write a function that computes the height of a regular binary tree (where the depth of a binary tree is the distance, i.e. number of arcs, from the root to the farthest leaf). a. int depth (treeType t)