def longestConsecutive_error(self, root):
        if not root:
            return 0

        maxa = 1
        l = self.longestConsecutive(root.left)
        r = self.longestConsecutive(root.right)
        maxa = max(maxa, l, r)
        if root.left and root.val + 1 == root.left.val:
            maxa = max(maxa, l+1)
        if root.right and root.val + 1 == root.right.val:
            maxa = max(maxa, r+1)

        return maxa
Naive case-insensitive search.
dataset/ETHPy150Open algorhythms/LeetCode/298 Binary Tree Longest Consecutive Sequence.py/Solution.longestConsecutive_error--crossover with--dataset/ETHPy150Open CiscoSystems/avos/openstack_dashboard/dashboards/project/volumes/volumes/tables.py/VolumesFilterAction.filter