[LeetCode] Find Mode in Binary Search Tree 找二分搜索数的众数
Posted Grandyang
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] Find Mode in Binary Search Tree 找二分搜索数的众数相关的知识,希望对你有一定的参考价值。
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).
s
以上是关于[LeetCode] Find Mode in Binary Search Tree 找二分搜索数的众数的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode_501. Find Mode in Binary Search Tree
[Leetcode] Binary tree -- 501. Find Mode in Binary Search Tree
leetcode501. Find Mode in Binary Search Tree
[LeetCode] Find Mode in Binary Search Tree 找二分搜索数的众数