max_depth = 0 def dfs(node, counter): if node is not None: counter += 1 if node->left is None and node -> right is None: max_depth = max(max_depth, counter) else: dfs(node->left, counter) dfs(node->right, counter)