当前位置：网站首页>Leetcode exercise 1 - binary tree pruning

Leetcode exercise 1 - binary tree pruning

2022-07-22 15:27:00 【But the sky is cold_ Good autumn】 

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:
    TreeNode* pruneTree(TreeNode* root) {
        if(nullptr == root) {
            return nullptr;
        }

        root->left = pruneTree(root->left);
        root->right = pruneTree(root->right);
        if(nullptr == root->left && nullptr == root->right && 0 == root->val) {
            return nullptr;
        }

        return root;
    }
};
原网站

版权声明
本文为[But the sky is cold_ Good autumn]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/203/202207220203125954.html

边栏推荐

猜你喜欢

随机推荐