501. Find Mode in Binary Search Tree
Easy
10 Points
Tree
Depth-First Search
Binary Search Tree
Binary Tree
Given the root of a binary search tree (BST) with duplicates, return all the mode(s) (i.e., the most frequently occurred element) in it.
If the tree has more than one mode, return them in any order.
Assume a BST is defined as follows:
Examples
Example 1
Input: root = [1,null,2,2]
Output: [2]
Example 2
Input: root = [0]
Output: [0]
Constraints
The number of nodes in the tree is in the range [1, 104].-105 <= Node.val <= 105
501. Find Mode in Binary Search Tree
Easy
10 Points
Tree
Depth-First Search
Binary Search Tree
Binary Tree
Given the root of a binary search tree (BST) with duplicates, return all the mode(s) (i.e., the most frequently occurred element) in it.
If the tree has more than one mode, return them in any order.
Assume a BST is defined as follows:
Examples
Example 1
Input: root = [1,null,2,2]
Output: [2]
Example 2
Input: root = [0]
Output: [0]
Constraints
The number of nodes in the tree is in the range [1, 104].-105 <= Node.val <= 105