JZ55 二叉树的深度
解法:遍历树的左右节点,然后比较大小在+1。
/**
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*
* C语言声明定义全局变量请加上static,防止重复定义
*/
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param pRoot TreeNode类
* @return int整型
*/
int TreeDepth(struct TreeNode* pRoot ) {
// write code here
int treeDeepth = 0;
int ldeep,rdeep,maxdeep;
if(pRoot==NULL)
return 0;
ldeep = TreeDepth(pRoot->left);
rdeep = TreeDepth(pRoot->right);
treeDeepth = ldeep>rdeep?ldeep+1:rdeep+1;
return treeDeepth;
}
从上往下打印二叉树 (层序遍历树)
/**
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*
* C语言声明定义全局变量请加上static,防止重复定义
*/
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param root TreeNode类
* @return int整型一维数组
* @return int* returnSize 返回数组行数
*/
int* PrintFromTopToBottom(struct TreeNode* root, int* returnSize ) {
// write code here
if(root == NULL){
*returnSize = 0;
return NULL;
}
int result[1000];
struct TreeNode *nodes[1000];
nodes[0] = root;
for(int i = 0;i<=(*returnSize);i++){
if(nodes[i]->left)
nodes[++(*returnSize)] = nodes[i]->left;
if(nodes[i]->right)
nodes[++(*returnSize)] = nodes[i]->right;
result[i] = nodes[i]->val;
}
(*returnSize)++;
return result;
}