[leetcode 104] Maximum Depth of Binary Tree

<span style="font-family: Arial, Helvetica, sans-serif; background-color: rgb(255, 255, 255);">Given a binary tree, find its maximum depth.</span>

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

递归

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode *root) {
        return dfs(root);
    }
    int dfs(TreeNode *root) {
        if (!root) {
            return 0;
        }
        return 1 + max(dfs(root->left), dfs(root->right));
    }
};

迭代（还有问题，待续）

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode *root) {
        if (!root) {
            return 0;
        }
        int res = 0;
        queue<TreeNode*> path;
        path.push(root);
        int count = 1;
        while (!path.empty()) {
            TreeNode *tmp = path.front();
            path.pop();
            count--;
            if (tmp->left != NULL) {
                path.push(tmp->left);
            }
            if (tmp->right != NULL) {
                path.push(tmp->right);
            }
            if (count == 0) {
                count = path.size();
                ++res;
            }
        }
        return res;
    }
};