$(4$ points$)$ Write a simple recursive function to calculate $($and return$)$ the height of a binary tree ${?}^{1}T.$ You should assume that $T$ is pointing to the root of the tree initially at input time.

The height of a tree $T$ is defined as the number of levels below the root. In other words, it is equal to the length of the longest path from the root to any leaf $($i$.$e$.,$ number of edges along the path from the root to the deepest leaf$).$ Note that the term "nodes" is used to include both internal nodes and leaf nodes. You can assume the following tree node structure:

class Node $\{$

Node $*$left; $,//$ points to the left subtree

Node ${?}^{**}$ right; $,//$ points to the right subtree

$\}$

Your answer can be in $C++$syntax or in the form of a generic pseudocode $($preferred$).$