验证搜索二叉树&&二叉树搜索树第K小&&二叉树的所有路径

验证搜索二叉树

/**
 * 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:
    long long prev = LONG_MIN;
    bool isValidBST(TreeNode* root) {
        if (root == nullptr)    return true;

        bool left = isValidBST(root->left);
        if (false == left)    return false;

        if (root->val <= prev)  return false;

        prev = root->val;
        bool right = isValidBST(root->right);
        return right;
    }
};

---

二叉树搜索树第K小

/**
 * 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 res = 0;
    int kthSmallest(TreeNode* root, int k) {
        dfs(root, k);
        return res;
    }
    void dfs(TreeNode* root, int& k){
        if(root == nullptr) return;
        dfs(root->left, k);
        if(k <= 0)  return;//剪枝
        k--;
        if(k == 0){
            res = root->val;
            return;//剪枝
        }  
        dfs(root->right, k);
    }
};

---

二叉树所有路径

/**
 * 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<string> res;
    vector<string> binaryTreePaths(TreeNode* root) {
        dfs(root, "");
        return res;
    }
    void dfs(TreeNode* root, string path){
        if(root == nullptr) return;
        path += to_string(root->val);
        if(root->left == nullptr && root->right == nullptr){
            res.push_back(path);
            return;
        }
        path += "->";
        if(root->left)  dfs(root->left, path);
        if(root->right)  dfs(root->right, path);
    }
};