劍指offer（35）-二叉樹的深度

題目描述

---

輸入一棵二叉樹，求該樹的深度。從根結點到葉結點依次經過的結點（含根、葉結點）形成樹的一條路徑，最長路徑的長度爲樹的深度。

代碼

---

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};*/
class Solution {
public:
    int TreeDepth(TreeNode* pRoot)
    {
        if (pRoot == NULL)
    {
        return 0;
    }
    int left = TreeDepth(pRoot -> left);
    int right = TreeDepth(pRoot -> right);
    return (left > right) ? (left + 1): (right + 1);
    }
};