104.c

#include<stdio.h>
#include<stdlib.h>

structTreeNode {
intval;
structTreeNode*left;
structTreeNode*right;
};

intmaxDepth(structTreeNode*root) {
if (root==NULL)
return0;
intl=maxDepth(root->left);
intr=maxDepth(root->right);
if (l>r)
returnl+1;
else
returnr+1;
}

voidprintTreePreOrder(structTreeNode*p) {
if (p!=NULL) {
printf("%d", p->val);
printTreePreOrder(p->left);
printTreePreOrder(p->right);
 }
elseprintf("#");
}

intmain() {
structTreeNode*t= (structTreeNode*)calloc(4, sizeof(structTreeNode));
structTreeNode*p=t;
p->val=1;
p->left=++t;
t->val=2;
t->left=t->right=NULL;
p->right=++t;
t->val=3;
p->right->left=NULL;
p->right->right=++t;
t->val=4;
t->left=t->right=NULL;
printTreePreOrder(p); printf("\n");

printf("%d\n", maxDepth(p));

return0;
}