def find(self, root, target, ret, lower=True):
        if not root:
            return

        if root.val == target:
            ret[0] = root.val
            return

        if target < root.val:
            if lower: ret[0] = max(ret[0], root.val)
            self.find(root.right, target, ret, lower)
        else:
            if not lower: ret[0] = min(ret[0], root.val)
            self.find(root.left, target, ret, lower)
dataset/ETHPy150Open algorhythms/LeetCode/270 Closest Binary Search Tree Value.py/Solution.find/swapped operands of `<`