class Solution {
public:
int result = INT_MAX;
TreeNode* pre = NULL;
void traversal(TreeNode* cur){
if(cur == nullptr) return;
traversal(cur->left);
if(pre != NULL){
result = min(cur->val - pre->val, result);
}
pre = cur;
traversal(cur->right);
}
int getMinimumDifference(TreeNode* root) {
traversal(root);
return result;
}
};
利用二叉搜索树的特性
class Solution {
public:
vector<int> res;
TreeNode* pre = nullptr;
int count = 0;
int max_count = 0;
void dfs(TreeNode* node) {
if (node == nullptr) return ;
dfs(node->left);
if (pre == nullptr) { // 第一个节点
count = 1;
} else if (pre->val == node->val) { // 与前一个节点数值相同
count++;
} else { // 与前一个节点数值不同
count = 1;
}
pre = node; // 更新上一个节点
if (count == max_count) { // 如果和最大值相同,放进result中
res.push_back(node->val);
}
if (count > max_count) { // 如果计数大于最大值频率
max_count = count; // 更新最大频率
res.clear(); // 很关键的一步,不要忘记清空result,之前result里的元素都失效了
res.push_back(node->val);
}
dfs(node->right); // 右
return ;
}
vector<int> findMode(TreeNode* root) {
dfs(root);
return res;
}
};
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if (root == nullptr || root == p || root == q) return root;
TreeNode* left = lowestCommonAncestor(root->left, p, q);
TreeNode* right = lowestCommonAncestor(root->right, p, q);
if (left == nullptr) return right;
if (right == nullptr) return left;
return root;
}
};