530.二叉搜索树的最小绝对差
题目链接:530.二叉搜索树的最小绝对差
文档链接:530.二叉搜索树的最小绝对差
视频链接:二叉搜索树中,需要掌握如何双指针遍历!| LeetCode:530.二叉搜索树的最小绝对差
C++实现
class Solution {
private:
int minAbs = INT_MAX;
TreeNode* pre = NULL;
void traversal(TreeNode* cur){
if(cur == NULL) return;
traversal(cur->left);
if(pre != NULL){
minAbs=min(minAbs, cur->val - pre->val);
}
pre = cur;
traversal(cur->right);
}
public:
int getMinimumDifference(TreeNode* root) {
traversal(root);
return minAbs;
}
};
501.二叉搜索树中的众数
题目链接:501.二叉搜索树中的众数
文档链接:501.二叉搜索树中的众数
视频链接:不仅双指针,还有代码技巧可以惊艳到你! | LeetCode:501.二叉搜索树中的众数
C++实现
class Solution {
private:
int maxCount = 0;
int count = 0;
TreeNode* pre = NULL;
vector<int> result;
void traversalBST(TreeNode* cur){
if(cur == NULL) return;
traversalBST(cur->left);
if(pre==NULL) count = 1;
else if(pre->val == cur->val) count++;
else if(pre->val != cur->val) count = 1;
pre = cur;
if(count==maxCount){
result.push_back(cur->val);
}
else if(count > maxCount){
maxCount = count;
result.clear();
result.push_back(cur->val);
}
traversalBST(cur->right);
}
public:
vector<int> findMode(TreeNode* root) {
result.clear();
traversalBST(root);
return result;
}
};
236. 二叉树的最近公共祖先
题目链接:236. 二叉树的最近公共祖先
文档链接:236. 二叉树的最近公共祖先
视频链接:自底向上查找,有点难度! | LeetCode:236. 二叉树的最近公共祖先
C++实现
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root == NULL) return NULL;
if(root == p || root == q) 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 return NULL;
}
};