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