530.二叉搜索树的最小绝对差
题目链接:力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台
文档讲解:代码随想录
视频讲解:二叉搜索树中,需要掌握如何双指针遍历!| LeetCode:530.二叉搜索树的最小绝对差_哔哩哔哩_bilibili
思路:利用二叉搜索树的特性,当中序遍历时二叉树的值是有序的
C++代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int min = INT_MAX;
TreeNode* pre = nullptr;
void findMin(TreeNode* root){
if(root == nullptr) return;
findMin(root->left);
if(pre != nullptr && root->val - pre->val < min)
min = root->val - pre->val;
pre = root;
findMin(root->right);
}
int getMinimumDifference(TreeNode* root) {
findMin(root);
return min;
}
};
501.二叉搜索树中的众数
题目链接:力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台
文档讲解:代码随想录
视频讲解:不仅双指针,还有代码技巧可以惊艳到你! | LeetCode:501.二叉搜索树中的众数_哔哩哔哩_bilibili
C++代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> result;
TreeNode* pre = nullptr;
int count = 0;
int maxCount = 0;
void find(TreeNode* root){
if(root == nullptr) return;
find(root->left);
if(pre == nullptr) count = 1;
else if(pre->val == root->val) count++;
else count = 1;
pre = root;
if(count == maxCount){
result.push_back(root->val);
}
if(count > maxCount){
result.clear();
maxCount = count;
result.push_back(root->val);
}
find(root->right);
}
vector<int> findMode(TreeNode* root) {
find(root);
return result;
}
};
236. 二叉树的最近公共祖先
题目链接:力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台
文档讲解:代码随想录
视频讲解:自底向上查找,有点难度! | LeetCode:236. 二叉树的最近公共祖先_哔哩哔哩_bilibili
思路:采用后续遍历
C++代码:
/**
* 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:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root == nullptr) return root;
if(root == p || root == q) return root;
TreeNode* left = lowestCommonAncestor(root->left, p, q);
TreeNode* right = lowestCommonAncestor(root->right, p, q);
if(left == nullptr && right != nullptr) return right;
else if(left != nullptr && right == nullptr) return left;
else if(left != nullptr && right != nullptr) return root;
else return nullptr;
}
};