def leftmost(self, cur, l):
        if not cur: return l
        return min(self.leftmost(cur.left, l-1), self.leftmost(cur.right, l+1))
dataset/ETHPy150Open algorhythms/LeetCode/314 Binary Tree Vertical Order Traversal.py/Solution.leftmost/original