public int findBottomLeftValue(TreeNode root) {
        LinkedList<Integer> list=new LinkedList<>();
        find(root, list, 0);
        return list.getLast();

    }
We get left side view of binary tree and return last element.
src/problems/medium/FindLeftMostElement.java