Computes the maximum depth of the tree. That is, how many steps down from node it can go. If a tree is: root -> childA -> subChildB
node
// Yields 2, since there are at max two steps down from rootcomputeMaxDepth(root); Copy
// Yields 2, since there are at max two steps down from rootcomputeMaxDepth(root);
Computes the maximum depth of the tree. That is, how many steps down from
nodeit can go. If a tree is: root -> childA -> subChildB