节点信息
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x = 0) : val(x), left(NULL), right(NULL) {}
};
算法实现
int Depth(TreeNode *T) {
if (T) {
int leftDepth = Depth(T->left);
int rightDepth = Depth(T->right);
return (leftDepth > rightDepth ? leftDepth : rightDepth) + 1;
} else {
return 0;
}
}