LeetCode_501. Find Mode in Binary Search Tree

package leetcode.easy;

/**
 * Definition for a binary tree node. public class TreeNode { int val; TreeNode
 * left; TreeNode right; TreeNode(int x) { val = x; } }
 */
public class FindModeInBinarySearchTree {
	private static void print_arr(int[] nums) {
		for (int num : nums) {
			System.out.print(num + " ");
		}
		System.out.println();
	}

	java.util.Map<Integer, Integer> map;
	int max = 0;

	public int[] findMode(TreeNode root) {
		this.map = new java.util.HashMap<>();
		inorder(root);
		java.util.List<Integer> list = new java.util.LinkedList<>();
		for (int key : map.keySet()) {
			if (map.get(key) == max) {
				list.add(key);
			}
		}
		int[] num = new int[list.size()];
		for (int i = 0; i < list.size(); i++) {
			num[i] = list.get(i);
		}
		return num;
	}

	public void inorder(TreeNode root) {
		if (root == null) {
			return;
		}
		map.put(root.val, map.getOrDefault(root.val, 0) + 1);
		if (map.get(root.val) > max) {
			max = map.get(root.val);
		}
		inorder(root.left);
		inorder(root.right);
	}

	@org.junit.Test
	public void test() {
		TreeNode tn11 = new TreeNode(1);
		TreeNode tn22 = new TreeNode(2);
		TreeNode tn33 = new TreeNode(2);
		tn11.left = null;
		tn11.right = tn22;
		tn22.left = tn33;
		tn22.right = null;
		tn33.left = null;
		tn33.right = null;
		print_arr(findMode(tn11));
	}
}