The height of a binary tree is the number of levels the tree has. For instance, if the tree has just the root node, then the height will be 0. If there is just one left branch from the root, then the height will be one, so on and so forth. Sketch an algorithm to find the height of a tree. It will take a pointer to the root of a tree and return the height as an integer. Think recursively. Implement the algorithm in your favorite language. (Python or c++)