501. 二叉搜索树中的众数

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def findMode(self, root: Optional[TreeNode]) -> List[int]:
        modedict = defaultdict(int)
        self.traversal(root, modedict)
        result = []
        if not root:
            return result
        max_freq = max(modedict.values())
        for key, value in modedict.items():
            if value == max_freq:
                result.append(key)
        return result
    def traversal(self, node, modedict):
        if not node:
            return
        self.traversal(node.left, modedict)
        modedict[node.val] += 1
        self.traversal(node.right, modedict)