标签：style blog color ar div log sp c ef
1.求二叉树的深度
int TreeDepth(binary_Tree* pRoot) { if(pRoot==NULL) return 0; int nLeft=TreeDepth(pRoot->left); int nRight=TreeDepth(pRoot->right); return (nLeft>nRight) ? (nLeft+1):(nRight+1) }
标签：style blog color ar div log sp c ef
原文地址：http://www.cnblogs.com/XDJjy/p/3947847.html
