LeetCode-501. Find Mode in Binary Search Tree [C++][Java]

LeetCode-501. Find Mode in Binary Search Treehttps://leetcode.com/problems/find-mode-in-binary-search-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:
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 cont

LeetCode-501. Find Mode in Binary Search Tree [C++][Java]最先出现在Python成神之路。