Back to course home
0% completed
Vote For New Content
Python Recursive Solution O(n) Time, O(1) Space
Hamidou Diallo
Apr 20, 2024
class Solution: def __init__(self): self.min_diff = float('inf') self.prev = None def minDiffInBST(self, root): if not root: return self.min_diff self.minDiffInBST(root.left) if self.prev: node_diff = abs(root.val - self.prev.val) self.min_diff = min(self.min_diff, node_diff) self.prev = root self.minDiffInBST(root.right) return self.min_diff
2
0
Comments
Comments
On this page