bst- nodes at distance k leetcode 863

Viewed 23

Can someone please help, I dont get why this is not working, it is returning empty list, it is probably some python stuff that I dont know :(

def distanceK(self, root, target, B):
        self.res=[]
        def findlevel(root,k,B):
            if not root:
                return 
            if k==B:
                self.res.append(root.val)
                return
            else:
                findlevel(root.right,k+1,B)
                findlevel(root.left,k+1,B)
             
        def recursive(root,target):
            if not root:
                return
            
            if root.val==target:
                findlevel(root,0,B)
                self.lm=1
                return
            if self.lm==1:
                return
            recursive(root.left,target)
            recursive(root.right,target)
            return
        
        self.lm=0
        recursive(root,target) 
        return self.res
0 Answers
Related