Skip to content

Commit 1d7643a

Browse files
yanglbmeyanglbme
committed
feat: add solutions to lc/lcof2 problems: Binary Tree Pruning
1 parent d9caea3 commit 1d7643a

File tree

7 files changed

+135
-15
lines changed

7 files changed

+135
-15
lines changed

‎lcof2/剑指 Offer II 047. 二叉树剪枝/README.md

+29-3
Original file line numberDiff line numberDiff line change
@@ -74,11 +74,11 @@
7474
# self.right = right
7575
class Solution:
7676
def pruneTree(self, root: TreeNode) -> TreeNode:
77-
if not root:
78-
return None
77+
if root is None:
78+
return root
7979
root.left = self.pruneTree(root.left)
8080
root.right = self.pruneTree(root.right)
81-
if root.val == 0 and not root.left and not root.right:
81+
if root.val == 0 and root.left is None and root.right is None:
8282
return None
8383
return root
8484
```
@@ -168,6 +168,32 @@ public:
168168
};
169169
```
170170
171+
### **JavaScript**
172+
173+
```js
174+
/**
175+
* Definition for a binary tree node.
176+
* function TreeNode(val, left, right) {
177+
* this.val = (val===undefined ? 0 : val)
178+
* this.left = (left===undefined ? null : left)
179+
* this.right = (right===undefined ? null : right)
180+
* }
181+
*/
182+
/**
183+
* @param {TreeNode} root
184+
* @return {TreeNode}
185+
*/
186+
var pruneTree = function (root) {
187+
if (!root) return null;
188+
root.left = pruneTree(root.left);
189+
root.right = pruneTree(root.right);
190+
if (root.val == 0 && !root.left && !root.right) {
191+
return null;
192+
}
193+
return root;
194+
};
195+
```
196+
171197
### **...**
172198

173199
```

‎lcof2/剑指 Offer II 047. 二叉树剪枝/Solution.js

+21
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
/**
2+
* Definition for a binary tree node.
3+
* function TreeNode(val, left, right) {
4+
* this.val = (val===undefined ? 0 : val)
5+
* this.left = (left===undefined ? null : left)
6+
* this.right = (right===undefined ? null : right)
7+
* }
8+
*/
9+
/**
10+
* @param {TreeNode} root
11+
* @return {TreeNode}
12+
*/
13+
var pruneTree = function (root) {
14+
if (!root) return null;
15+
root.left = pruneTree(root.left);
16+
root.right = pruneTree(root.right);
17+
if (root.val == 0 && !root.left && !root.right) {
18+
return null;
19+
}
20+
return root;
21+
};

‎lcof2/剑指 Offer II 047. 二叉树剪枝/Solution.py

+3-3
Original file line numberDiff line numberDiff line change
@@ -6,10 +6,10 @@
66
# self.right = right
77
class Solution:
88
def pruneTree(self, root: TreeNode) -> TreeNode:
9-
if not root:
10-
return None
9+
if root is None:
10+
return root
1111
root.left = self.pruneTree(root.left)
1212
root.right = self.pruneTree(root.right)
13-
if root.val == 0 and not root.left and not root.right:
13+
if root.val == 0 and root.left is None and root.right is None:
1414
return None
1515
return root

‎solution/0800-0899/0814.Binary Tree Pruning/README.md

+29-3
Original file line numberDiff line numberDiff line change
@@ -64,12 +64,12 @@
6464
# self.left = left
6565
# self.right = right
6666
class Solution:
67-
def pruneTree(self, root: TreeNode) -> TreeNode:
68-
if not root:
67+
def pruneTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
68+
if root is None:
6969
return None
7070
root.left = self.pruneTree(root.left)
7171
root.right = self.pruneTree(root.right)
72-
if root.val == 0 and not root.left and not root.right:
72+
if root.val == 0 and root.left is None and root.right is None:
7373
return None
7474
return root
7575
```
@@ -159,6 +159,32 @@ public:
159159
};
160160
```
161161
162+
### **JavaScript**
163+
164+
```js
165+
/**
166+
* Definition for a binary tree node.
167+
* function TreeNode(val, left, right) {
168+
* this.val = (val===undefined ? 0 : val)
169+
* this.left = (left===undefined ? null : left)
170+
* this.right = (right===undefined ? null : right)
171+
* }
172+
*/
173+
/**
174+
* @param {TreeNode} root
175+
* @return {TreeNode}
176+
*/
177+
var pruneTree = function (root) {
178+
if (!root) return null;
179+
root.left = pruneTree(root.left);
180+
root.right = pruneTree(root.right);
181+
if (root.val == 0 && !root.left && !root.right) {
182+
return null;
183+
}
184+
return root;
185+
};
186+
```
187+
162188
### **...**
163189

164190
```

‎solution/0800-0899/0814.Binary Tree Pruning/README_EN.md

+29-3
Original file line numberDiff line numberDiff line change
@@ -55,12 +55,12 @@ The diagram on the right represents the answer.
5555
# self.left = left
5656
# self.right = right
5757
class Solution:
58-
def pruneTree(self, root: TreeNode) -> TreeNode:
59-
if not root:
58+
def pruneTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
59+
if root is None:
6060
return None
6161
root.left = self.pruneTree(root.left)
6262
root.right = self.pruneTree(root.right)
63-
if root.val == 0 and not root.left and not root.right:
63+
if root.val == 0 and root.left is None and root.right is None:
6464
return None
6565
return root
6666
```
@@ -148,6 +148,32 @@ public:
148148
};
149149
```
150150
151+
### **JavaScript**
152+
153+
```js
154+
/**
155+
* Definition for a binary tree node.
156+
* function TreeNode(val, left, right) {
157+
* this.val = (val===undefined ? 0 : val)
158+
* this.left = (left===undefined ? null : left)
159+
* this.right = (right===undefined ? null : right)
160+
* }
161+
*/
162+
/**
163+
* @param {TreeNode} root
164+
* @return {TreeNode}
165+
*/
166+
var pruneTree = function (root) {
167+
if (!root) return null;
168+
root.left = pruneTree(root.left);
169+
root.right = pruneTree(root.right);
170+
if (root.val == 0 && !root.left && !root.right) {
171+
return null;
172+
}
173+
return root;
174+
};
175+
```
176+
151177
### **...**
152178

153179
```

‎solution/0800-0899/0814.Binary Tree Pruning/Solution.js

+21
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
/**
2+
* Definition for a binary tree node.
3+
* function TreeNode(val, left, right) {
4+
* this.val = (val===undefined ? 0 : val)
5+
* this.left = (left===undefined ? null : left)
6+
* this.right = (right===undefined ? null : right)
7+
* }
8+
*/
9+
/**
10+
* @param {TreeNode} root
11+
* @return {TreeNode}
12+
*/
13+
var pruneTree = function (root) {
14+
if (!root) return null;
15+
root.left = pruneTree(root.left);
16+
root.right = pruneTree(root.right);
17+
if (root.val == 0 && !root.left && !root.right) {
18+
return null;
19+
}
20+
return root;
21+
};

‎solution/0800-0899/0814.Binary Tree Pruning/Solution.py

+3-3
Original file line numberDiff line numberDiff line change
@@ -5,11 +5,11 @@
55
# self.left = left
66
# self.right = right
77
class Solution:
8-
def pruneTree(self, root: TreeNode) -> TreeNode:
9-
if not root:
8+
def pruneTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
9+
if root is None:
1010
return None
1111
root.left = self.pruneTree(root.left)
1212
root.right = self.pruneTree(root.right)
13-
if root.val == 0 and not root.left and not root.right:
13+
if root.val == 0 and root.left is None and root.right is None:
1414
return None
1515
return root

0 commit comments

Comments
 (0)