[leetcode 515]Find Largest Value in Each Tree Row

问题描述

1
/ \
3   2
/ \   \
5   3   9

代码

int cal_depth(TreeNode* root) {
if (root == NULL)
return 0;
return max(cal_depth(root->left),cal_depth(root->right))+1;
}
void cal(TreeNode* root,vector<int>& result,int depth) {
if (root == NULL)
return;
if (result[depth] < root->val)
result[depth] = root->val;
cal(root->left,result,depth+1);
cal(root->right,result,depth+1);
}
vector<int> largestValues(TreeNode* root) {
int depth = cal_depth(root);
vector<int> result(depth,1<<31);
cal(root,result,0);
return result;
}