Leetcode 二叉树（二）

101. 对称二叉树

力扣题目链接

class Solution {
public:
    bool compare(TreeNode* left, TreeNode* right){
        if(left == NULL && right == NULL)   return true;
        if(left != NULL && right == NULL)   return false;
        if(left == NULL && right != NULL)   return false;
        if(left->val != right->val) return false;

        int outside = compare(left->left, right->right);
        int inside = compare(left->right, right->left);
        bool  isSame = outside && inside;
        return isSame;
    }
    bool isSymmetric(TreeNode* root) {
        if(root == NULL)    return NULL;
        return compare(root->left, root->right);
    }
};

104. 二叉树的最大深度

力扣题目链接

class Solution {
public:
    int getDepth(TreeNode* node){
        if(node == NULL)    return 0;
        int leftNum = getDepth(node->left);
        int rightNum = getDepth(node->right);
        int totalNum = 1 + max(leftNum, rightNum);
        return totalNum;
    }
    int maxDepth(TreeNode* root) {
        return getDepth(root);
    }
};

111. 二叉树的最小深度

力扣题目链接

class Solution {
public:
    int getDepth(TreeNode* node) {
        if(node == NULL)    return 0;
        int leftnode = getDepth(node->left);
        int rightnode = getDepth(node->right);        
        if(node->left == NULL && node->right != NULL)  return 1 + rightnode;
        if(node->left != NULL && node->right == NULL) return 1 + leftnode;
        int totalndoe = 1 + min(leftnode, rightnode);
        return totalndoe; 
    }
    int minDepth(TreeNode* root) {
        return getDepth(root);
    }
};

222. 完全二叉树的节点个数

力扣题目链接

class Solution {
public:
    int getnodes(TreeNode* node) {
        if(node == NULL) return 0;
        int leftnode = getnodes(node->left);
        int rightnode = getnodes(node->right);
        int totalnode = leftnode + rightnode + 1;
        return totalnode;
    }
    int countNodes(TreeNode* root) {
        return getnodes(root);
    }
};

257. 二叉树的所有路径

力扣题目链接

class Solution {
public:
    void traversal(TreeNode* node, vector<int>& path, vector<string>& result){
        path.push_back(node->val);
        if(node->left == NULL && node->right == NULL){
            string sPath;
            for(int i = 0; i < path.size() - 1; i++){
                sPath += to_string(path[i]);
                sPath += "->";
            }        
            sPath += to_string(path[path.size() - 1]);
            result.push_back(sPath);
            return;
        }    
        if(node->left){
            traversal(node->left, path, result);
            path.pop_back();
        }
        if(node->right){
            traversal(node->right, path, result);
            path.pop_back();
        }
    }
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<int> path;
        vector<string> result;
        if(root == NULL)    return result;
        traversal(root, path, result);
        return result;
    }
};

110. 平衡二叉树

力扣题目链接

class Solution {
public:
    int getHeight(TreeNode* node){
        if(node == NULL)    return 0;
        int leftHeight = getHeight(node->left);
        int rightHeight = getHeight(node->right);
        if(leftHeight == -1)    return -1;
        if(rightHeight == -1)   return-1;
        return abs(leftHeight - rightHeight) > 1 ? -1 : 1 + max(leftHeight, rightHeight);
    }
    bool isBalanced(TreeNode* root) {
        return getHeight(root) == -1 ? false : true;
    }
};