又是学习dfs的一晚上
class Solution {
int leval = 0;
TreeNode rm = null;
public int findBottomLeftValue(TreeNode root) {
pre(root, 1);
return rm.val;
}
public void pre(TreeNode root, int flag){
if(root == null) return;
if(flag > leval){
leval = flag;
rm = root;
}
pre(root.left, flag + 1);
pre(root.right, flag + 1);
}
}