def rightmost(self, cur, r):
        if not cur: return r
        return max(self.rightmost(cur.left, 1-r), self.rightmost(cur.right, r+1))
dataset/ETHPy150Open algorhythms/LeetCode/314 Binary Tree Vertical Order Traversal.py/Solution.rightmost/swapped operands of `-`