题目:
解法:使用深度搜索算法,遍历整个二叉树
bool dfs(TreeNode* root) 当整个子树的节点都为0就删去,使用了后续遍历。具体直接看代码:
/**
* 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:
TreeNode* pruneTree(TreeNode* root) {
if (dfs(root)) {
return nullptr;
}
return root;
}
bool dfs(TreeNode* root) {
if (root == nullptr) {
return true;
}
bool left = dfs(root->left), right = dfs(root->right);
if (root->val == 0 && left && right) {
return true;
}
if (left == true) {
root->left = nullptr;
}
if (right == true) {
root->right = nullptr;
}
return false;
}
};