We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 3ce4317 commit 6236d09Copy full SHA for 6236d09
flatten_binary_tree.py
@@ -0,0 +1,27 @@
1
+# Definition for a binary tree node.
2
+# class TreeNode:
3
+# def __init__(self, x):
4
+# self.val = x
5
+# self.left = None
6
+# self.right = None
7
+
8
+class Solution:
9
+ def __init__(self):
10
+ self.prev = None
11
12
+ def flatten(self, root: TreeNode) -> None:
13
+ """
14
+ Do not return anything, modify root in-place instead.
15
+ #reverse postorder traversal
16
17
18
+ if not root: return None
19
20
+ self.flatten(root.right)
21
+ self.flatten(root.left)
22
23
+ root.right = self.prev
24
+ root.left = None
25
+ self.prev = root
26
27
0 commit comments