treeDepth<T> function

int treeDepth<T>(
  1. BinaryTreeNode<T>? root
)

Implementation

int treeDepth<T>(BinaryTreeNode<T>? root) {
  if (root == null) return -1;

  final int leftDepth = treeDepth(root.left);
  final int rightDepth = treeDepth(root.right);

  return 1 + (leftDepth > rightDepth ? leftDepth : rightDepth);
}