输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
#include <iostream>
#include<stdio.h>
using namespace std;
struct BinaryTreeNode{
int value;
BinaryTreeNode* left;
BinaryTreeNode* right;
};
int binaryTreeDeep(BinaryTreeNode* root){
if(root==NULL){
return 0;
}
int left,right;
left = binaryTreeDeep(root->left);
right = binaryTreeDeep(root->right);
return (left>right?left:right)+1;
}
int main()
{
return 0;
}