Find Mode in Binary Search Tree问题及解法
来源:互联网 发布:java.nio.file.files 编辑:程序博客网 时间:2024/05/29 08:40
问题描述:
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.
问题分析:可以通过遍历统计各个值出现的次数,最终确定答案。
过程详见代码:
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:map<int,int> m;int maxi;public: vector<int> findMode(TreeNode* root) { vector<int> res; maxi = 0; travarse(m,root,maxi); for(map<int,int>::iterator it = m.begin(); it != m.end();it++) { if(it->second == maxi) res.push_back(it->first);}return res; } void travarse(map<int,int>& m,TreeNode* root,int& maxi) { if(root == NULL) return; if(m.count(root->val) == 0) m.insert(pair<int,int>(root->val,1)); else m[root->val]++; if(m[root->val] > maxi) maxi = m[root->val]; travarse(m,root->left,maxi); travarse(m,root->right,maxi);}};
0 0
- Find Mode in Binary Search Tree问题及解法
- 501. Find Mode in Binary Search Tree
- 501. Find Mode in Binary Search Tree
- 501. Find Mode in Binary Search Tree
- 501. Find Mode in Binary Search Tree
- Find Mode in Binary Search Tree
- Find Mode in Binary Search Tree
- Find Mode in Binary Search Tree
- 501. Find Mode in Binary Search Tree
- leetcode501. Find Mode in Binary Search Tree
- 501. Find Mode in Binary Search Tree
- Find Mode in Binary Search Tree
- 501. Find Mode in Binary Search Tree
- 501. Find Mode in Binary Search Tree
- 501. Find Mode in Binary Search Tree
- leetcode[Find Mode in Binary Search Tree]//待整理多种解法
- [Leetcode] Binary tree -- 501. Find Mode in Binary Search Tree
- 501.Find Mode in Binary Search Tree(Tree-Easy)
- 个人项目面试题
- 剑指offer-37.数字在排序数组中出现的次数
- 我跟oracle合不来
- 进程,线程与线程池(1)
- 加载图片带缓存--狸菇凉_
- Find Mode in Binary Search Tree问题及解法
- Android系统工程模式启动过程详解
- 简单线性回归
- 1057. 数零壹
- Linux配置阿里云镜像
- RGB与YCbCr颜色空间的转换
- ListView分页多条目加载
- C语言之浮点数的内存表示
- TCP socket心跳包示例程序