剑指offer 求二叉树的深度 C++

题目描述

输入一棵二叉树，求该树的深度。从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度。

部分代码

class Solution {
public:
    int TreeDepth(TreeNode* pRoot)
    {
        if(!pRoot) return 0;
        return 1 + max(TreeDepth(pRoot->left),TreeDepth(pRoot->right));
    }
};

完整代码

#include <iostream>

using namespace std;

struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};

 int TreeDepth(TreeNode* pRoot){
 	if(!pRoot) return 0;
    return 1 + max(TreeDepth(pRoot->left),TreeDepth(pRoot->right));
}

int main(){
	/* Constructed binary tree is 
			10 
			/ \ 
		5	 15 
			/ \ 
		   14	20
	*/
	TreeNode *root = new TreeNode(10); 
	root->left	 = new TreeNode(5); 
	root->right	 = new TreeNode(15); 
	root->right->left = new TreeNode(14); 
	root->right->right = new TreeNode(20); 

	cout << TreeDepth(root);
	
	return 0;
}