Leecode： Find Mode in Binary Search Tree

思路：中序遍历的时候，重复的数字会连续出现，这是解题的关键
上代码：

  function findMode(root: TreeNode | null): number[] {
        let base = 0, count = 0, maxCount = 0, res:number[] = [];
        dfs(root);
        return res;

        function helper(num: number){
            if(base == num){
                count++;
            }else{
                count = 1;
                base = num;
            }
            if(count == maxCount){
                res.push(num);
            }
            if(count > maxCount){
                maxCount = count;
                res = [num];
            }
        }

        function dfs(root: TreeNode | null){
            if(root == null) return;
            dfs(root.left);
            helper(root.val);
            dfs(root.right);
        }

    };

标签：count,Binary,Search,res,Tree,dfs,num,maxCount,root
来源： https://blog.csdn.net/xiongBen1993/article/details/116572632