From ec009f7981380034fb4d87a709847849010798fe Mon Sep 17 00:00:00 2001 From: Azureki Date: Sun, 2 Dec 2018 18:54:25 +0800 Subject: [PATCH] =?UTF-8?q?=E5=85=88=E5=BA=8F=E9=81=8D=E5=8E=86=E5=92=8C?= =?UTF-8?q?=E5=90=8E=E5=BA=8F=E9=81=8D=E5=8E=86?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- lc144. Binary Tree Preorder Traversal.py | 24 ++++++++++++++++++++++++ lc145. Binary Tree Postorder.py | 24 ++++++++++++++++++++++++ 2 files changed, 48 insertions(+) create mode 100644 lc144. Binary Tree Preorder Traversal.py create mode 100644 lc145. Binary Tree Postorder.py diff --git a/lc144. Binary Tree Preorder Traversal.py b/lc144. Binary Tree Preorder Traversal.py new file mode 100644 index 0000000..fb58dd4 --- /dev/null +++ b/lc144. Binary Tree Preorder Traversal.py @@ -0,0 +1,24 @@ +# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, x): +# self.val = x +# self.left = None +# self.right = None + +class Solution: + def preorderTraversal(self, root): + """ + :type root: TreeNode + :rtype: List[int] + """ + def dfs(root): + if not root: + return + res.append(root.val) + dfs(root.left) + dfs(root.right) + + res=[] + dfs(root) + return res + diff --git a/lc145. Binary Tree Postorder.py b/lc145. Binary Tree Postorder.py new file mode 100644 index 0000000..b5bd617 --- /dev/null +++ b/lc145. Binary Tree Postorder.py @@ -0,0 +1,24 @@ +# Definition for a binary tree node. +# class TreeNode: +# def __init__(self, x): +# self.val = x +# self.left = None +# self.right = None + +class Solution: + def postorderTraversal(self, root): + """ + :type root: TreeNode + :rtype: List[int] + """ + def dfs(root): + if not root: + return + dfs(root.left) + dfs(root.right) + res.append(root.val) + + res=[] + dfs(root) + return res +