代码随想录算法训练营第十九天|530.二叉搜索树的最小绝对差|236. 二叉树的最近公共祖先

530.二叉搜索树的最小绝对差

直接利用二叉搜索树的性质 左中右中序遍历求相邻差值

1、用vec方式

class Solution {
public:
    int minDiff = 100000;
    vector<int> vec;
    void traversal(TreeNode* root,vector<int>& vec) {
        if(root==nullptr) return;
        if(root->left) traversal(root->left,vec);
        vec.push_back(root->val);
        if(root->right) traversal(root->right,vec);
    }
    int getMinimumDifference(TreeNode* root) {
        traversal(root,vec);
        for(int i=0;i<vec.size()-1;i++) {
            if(vec[i+1]-vec[i]<minDiff)
                minDiff=vec[i+1]-vec[i];
        }
        return minDiff;
    }
};

2、双指针方法

class Solution {
public:
    int minDiff = 100000;
    TreeNode* pre = nullptr;
    void traversal(TreeNode* root) {
        if(root==nullptr) return;
        if(root->left) traversal(root->left);
        if(pre!=nullptr&&minDiff>root->val-pre->val) {
            minDiff = root->val-pre->val;
        }
        pre=root;
        if(root->right) traversal(root->right);
    }
    int getMinimumDifference(TreeNode* root) {
        traversal(root);
        return minDiff;
    }
};

501.二叉搜索树中的众数

用vec方法

class Solution {
public:
    vector<int> vec;
    void traversal(TreeNode* root,vector<int> &vec) {
        if(root==nullptr) return;
        traversal(root->left,vec);
        vec.push_back(root->val);
        traversal(root->right,vec);
    }
    vector<int> findMode(TreeNode* root) {
        vector<int> result;
        int max=1,cnt=1;
        traversal(root,vec);
        result.push_back(vec[0]);
        for(int i=0;i<vec.size()-1;i++){
            if(vec[i+1]==vec[i]) {
                cnt++;
            }
            if(vec[i+1]!=vec[i]) cnt=1;
            if(cnt==max) result.push_back(vec[i+1]);
            if(cnt>max) {
                result.clear();
                result.push_back(vec[i+1]);
                max=cnt;
            }
        }
        return result;
    }
};

使用双指针的方法

直接在递归里面处理

class Solution {
public:
    TreeNode* pre = nullptr;
    int count;
    int maxnum=1;
    vector<int> result;
    void traversal(TreeNode* root) {
        if(root==nullptr) return;
        traversal(root->left);
        if(!pre) count=1;
        else if(pre->val==root->val) {
            count++;
        }
        else count=1;
        pre = root;
        if(count==maxnum) result.push_back(root->val);
        if(count>maxnum) {
            result.clear();
            result.push_back(root->val);
            maxnum=count;
        }
        traversal(root->right);
    }
    vector<int> findMode(TreeNode* root) {
        traversal(root);
        return result;
    }
};

236. 二叉树的最近公共祖先

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root==NULL) return NULL;
        if(root==p) return p;
        if(root==q) return q;
        TreeNode* left = lowestCommonAncestor(root->left,p,q);
        TreeNode* right = lowestCommonAncestor(root->right,p,q);
        if(left!=NULL&&right!=NULL) return root;
        else if(left==NULL&&right!=NULL) return right;
        else if(left!=NULL&&right==NULL) return left;
        else return NULL;
        return root;
    }
};