501. Find Mode in Binary Search Tree

解題說明

C++ 解法

複雜度分析

虛擬碼

1. Initialize result = [], maxCount = 0, curCount = 0, curVal = 0, prev = null
2. Morris inorder traversal on root:
   a. For each visited node:
      - If node.val == curVal: curCount++
      - Else: curVal = node.val, curCount = 1
      - If curCount > maxCount: maxCount = curCount, clear result, add curVal
      - Else if curCount == maxCount: add curVal to result
3. Return result

其他解法

延伸思考