找二叉树左下角的值

class Solution {
public:int maxd=0;int result;void traversal(TreeNode* root,int depth){if(root->left==NULL&&root->right==NULL){if(depth>maxd){maxd=depth;result=root->val;}}if(root->left){depth++;traversal(root->left,depth);depth--;}if(root->right){depth++;traversal(root->right,depth);depth--;}}int findBottomLeftValue(TreeNode* root) {traversal(root,1);return result;}
};