Available question text
Given a BST that may contain duplicate values, return all value(s) that occur most frequently (the mode(s)) in the tree. The key insight is that the BST's sorted order makes equal values consecutive (so an inorder traversal — even in O(1) extra space via Morris traversal for the follow-up — lets you count runs efficiently).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 501. Find Mode in Binary Search Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source