This approach involves using a recursive function that traverses the tree in a depth-first manner. For each node, calculate the maximum depth of its left and right subtrees, and add 1 for the current node itself. The function returns the maximum of these two values. This provides an elegant and intuitive solution, leveraging the inherent recursive structure of trees.
Time Complexity: O(n) where n is the number of nodes, as each node is visited once.
Space Complexity: O(h) where h is the height of the tree, due to the stack space in recursion.
1#include <stdio.h>
2typedef struct TreeNode {
3 int val;
4 struct TreeNode *left;
5 struct TreeNode *right;
6} TreeNode;
7
8int maxDepth(struct TreeNode* root) {
9 if (root == NULL) return 0;
10 int leftDepth = maxDepth(root->left);
11 int rightDepth = maxDepth(root->right);
12 return (leftDepth > rightDepth ? leftDepth : rightDepth) + 1;
13}The function maxDepth checks if the current node is null. If so, it returns 0, indicating no depth. Otherwise, it recursively computes the depth of the left and right subtrees, takes their maximum, and adds 1 to include the current node.
This approach involves using a queue to perform a Breadth-First Search (BFS) on the tree. By iterating level by level, we increment the depth counter with each level traversed completely.
Time Complexity: O(n) due to each node being visited once.
Space Complexity: O(n) where n is the maximum number of nodes at any level.
1#include <queue>
2using namespace std;
3struct TreeNode {
4 int val;
5 TreeNode *left;
6 TreeNode *right;
7 TreeNode(int x) : val(x), left(NULL), right(NULL) {}
8};
9
10int maxDepth(TreeNode* root) {
11 if (!root) return 0;
12 queue<TreeNode*> q;
13 q.push(root);
14 int depth = 0;
15 while (!q.empty()) {
16 int level_size = q.size();
17 for (int i = 0; i < level_size; ++i) {
18 TreeNode* node = q.front(); q.pop();
19 if (node->left) q.push(node->left);
20 if (node->right) q.push(node->right);
21 }
22 depth++;
23 }
24 return depth;
25}Using a queue from the Standard Template Library (STL), nodes of each level are processed iteratively. Each loop iteration processes a full level, incrementing the depth with each completed level.