leetcode 计算二叉树中出现最多的元素，Python实现

题目：

Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST.

Assume a BST is defined as follows:

• The left subtree of a node contains only nodes with keys less than or equal to the node's key.
• The right subtree of a node contains only nodes with keys greater than or equal to the node's key.
• Both the left and right subtrees must also be binary search trees.

For example:
Given BST [1,null,2,2],

   1
    \
     2
    /
   2

return [2].

Note: If a tree has more than one mode, you can return them in any order.

思路：递归地遍历二叉树，同时用dictionary记录树中的每一个元素；

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution(object):
    def findMode(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """
        dic = {}
        self.excute(root,dic)
        
        save = []  #用于存放最终结果
        count = 0
        for k in dic:
            if dic[k]==count:
                save.append(k)
            if dic[k]>count:
                count = dic[k]  #如果当前key的统计值大于之前的最大值，则更新save;
                save = [k]
        return save
                
        
    def excute(self,root,dic):
        if not root:
            return 
        dic[root.val] = 1+dic.get(root.val,0)
        self.excute(root.left,dic)
        self.excute(root.right,dic)