Leetcode——501. Find Mode in Binary Search Tree

题目原址

https://leetcode.com/problems/find-mode-in-binary-search-tree/description/

题目描述

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.
Follow up: Could you do that without using any extra space? (Assume that the implicit stack space incurred due to recursion does not count).

解题思路

给定一个BST，注意这里面指出，左孩子是可以等于其根节点的值的，这里想要找到二叉树中的众数。

思路：
找到众数，所以肯定是要将二叉树完全遍历到。这里采用层次遍历，利用Queue进行层次遍历，每遍历一个数就将其放在hashmap中，hashmap的键为二叉树节点值，值为同一个键出现的次数。在遍历过程中记录最多的值放在max中，最后遍历处hashmao中值等于max的键放在数组中即可。

AC代码

class Solution {
    public int[] findMode(TreeNode root) {
        int max = 0;
        int[] arr;
        Queue<TreeNode> queue = new LinkedList<>();
        Map<Integer, Integer> map = new HashMap<>();
        if(root == null)
            return new int[0];
        queue.add(root);
        while(queue.size() > 0){
            int size = queue.size();
            for(int i = 0; i < size; i++) {
                TreeNode tn = queue.poll();
                map.put(tn.val, map.getOrDefault(tn.val, 0) + 1);
                max = Math.max(max, map.get(tn.val));
                if(tn.left != null)
                    queue.add(tn.left);
                if(tn.right != null)
                    queue.add(tn.right);
            }
        }
        arr = new int[map.size()];
        int j = 0;
        for(int i: map.keySet()) {
            if(max == map.get(i)) 
                arr[j++] = i;
        }
        return Arrays.copyOf(arr, j);        
    }
}