输入一棵二叉树,求该树的深度。从根结点到叶结点依次通过的结点(含根、叶结点)造成树的一条路径,最长路径的长度为树的深度。web
基础svg
/* 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 leftTreeDepth = TreeDepth(pRoot->left); int rightTreeDepth = TreeDepth(pRoot->right); return leftTreeDepth > rightTreeDepth ? leftTreeDepth + 1 : rightTreeDepth + 1; } };
运行时间:3ms
占用内存:452kspa