Most Frequent Values in a BST
You are given the root of a binary tree. This BST may contain repeated values: a left child is smaller than or equal to its node, and a right child is larger than or equal to it. Return every value that appears the most times, in increasing order. An empty tree gives [].
Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.
Example 1
root [1,null,2,2]
returns [2]
2 appears twice, 1 once.
Constraints
0 <= number of nodes <= 100-100 <= node.val <= 100- Left child <= node <= right child at every node.
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.