501. 二叉搜索树中的众数
class Solution:
def findMode(self, root: Optional[TreeNode]) -> List[int]:
self.mode = []
self.curCount = 0
self.maxCount = 0
self.prev = None
self.traverse(root)
return self.mode
def traverse(self, root):
if not root:
return
self.traverse(root.left)
if not self.prev:
self.curCount = 1
self.maxCount = 1
self.mode.append(root.val)
else:
if root.val == self.prev.val:
self.curCount += 1
if self.curCount == self.maxCount:
self.mode.append(root.val)
elif self.curCount > self.maxCount:
self.mode.clear()
self.maxCount = self.curCount
self.mode.append(root.val)
if root.val != self.prev.val:
self.curCount = 1
if self.curCount == self.maxCount:
self.mode.append(root.val)
self.prev = root
self.traverse(root.right)