530. 二叉搜索树的最小绝对差
层序遍历
class Solution {
public:
int getMinimumDifference(TreeNode* root) {
queue<TreeNode*> que;
que.push(root);
vector<int> vec;
while (!que.empty()){
int size = que.size();
for (int i = 0; i < size; i++){
TreeNode* node = que.front();
que.pop();
vec.push_back(node->val);
if (node->left) que.push(node->left);
if (node->right) que.push(node->right);
}
}
int result = INT_MAX;
for (int i = 0; i < vec.size(); i++){
for (int j = i + 1; j < vec.size(); j++){
if (abs(vec[j] - vec[i]) < result){
result = abs(vec[j] - vec[i]);
}
}
}
return result;
}
};
注:自己最开始写的时候忘记了题目的要求是二叉搜索树,直接用了层次遍历,把每个元素值存到vector中,然后就最小的差值,当然这种方式适用于所有二叉树。
中序遍历
class Solution {
public:
vector<int> vec;
void traversal(TreeNode* node){
if (node == NULL) return ;
traversal(node->left);
vec.push_back(node->val);
traversal(node->right);
}
int getMinimumDifference(TreeNode* root) {
traversal(root);
int result = INT_MAX;
for (int i = 1; i < vec.size(); i++){
result = min(result, vec[i] - vec[i - 1]);
}
return result;
}
};
迭代法
定义双指针:cur当前遍历节点,pre当前遍历节点的前一个节点
class Solution {
public:
int getMinimumDifference(TreeNode* root) {
stack<TreeNode*> st;
TreeNode* cur = root;
TreeNode* pre = NULL;
int result = INT_MAX;
while (cur != NULL || !st.empty()) {
if (cur != NULL) { // 指针来访问节点,访问到最底层
st.push(cur); // 将访问的节点放进栈
cur = cur->left; // 左
} else {
cur = st.top();
st.pop();
if (pre != NULL) { // 中
result = min(result, cur->val - pre->val);
}
pre = cur;
cur = cur->right; // 右
}
}
return result;
}
};
501. 二叉搜索树中的众数
哈希表+中序遍历
class Solution {
public:
vector<int> vec; //存储树的元素值
vector<int> result;
void inorder(TreeNode* node){
if (node == NULL) return ;
inorder(node->left);
vec.push_back(node->val);
inorder(node->right);
}
//定义比较大小
bool static cmp(const pair<int, int> &a, const pair<int, int> &b){
return a.second > b.second;
}
vector<int> findMode(TreeNode* root) {
if (vec.size() == 1) return vec;
inorder(root);
unordered_map<int, int> map;
//利用map统计频率
for (int i = 0; i < vec.size(); i++){
map[vec[i]]++;
}
vector<pair<int, int>> temp(map.begin(), map.end());
//按照频率排序
sort(temp.begin(), temp.end(), cmp);
result.push_back(temp[0].first);
//处理多个众数
for (int i = 1; i < temp.size(); i++){
if (temp[i].second == temp[0].second) result.push_back(temp[i].first);
else break;
}
return result;
}
};
双指针+递归
class Solution {
private:
int maxCount = 0; // 最大频率
int count = 0; // 统计频率
TreeNode* pre = NULL;
vector<int> result;
void searchBST(TreeNode* cur) {
if (cur == NULL) return ;
searchBST(cur->left); // 左
// 中
if (pre == NULL) { // 第一个节点
count = 1;
} else if (pre->val == cur->val) { // 与前一个节点数值相同
count++;
} else { // 与前一个节点数值不同
count = 1;
}
pre = cur; // 更新上一个节点
if (count == maxCount) { // 如果和最大值相同,放进result中
result.push_back(cur->val);
}
if (count > maxCount) { // 如果计数大于最大值频率
maxCount = count; // 更新最大频率
result.clear(); // 很关键的一步,不要忘记清空result,之前result里的元素都失效了
result.push_back(cur->val);
}
searchBST(cur->right); // 右
return ;
}
public:
vector<int> findMode(TreeNode* root) {
count = 0;
maxCount = 0;
pre = NULL; // 记录前一个节点
result.clear();
searchBST(root);
return result;
}
};
236. 二叉树的最近公共祖先(回头多看几遍)
递归法
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if (root == q || root == p || root == NULL) return root;
TreeNode* left = lowestCommonAncestor(root->left, p, q);
TreeNode* right = lowestCommonAncestor(root->right, p, q);
if (left != NULL && right != NULL) return root;
if (left == NULL && right != NULL) return right;
else if (left != NULL && right == NULL) return left;
else { // (left == NULL && right == NULL)
return NULL;
}
}
};