Binary Tree Preorder Traversal python
2017-09-02 19:38
330 查看
Binary Tree Preorder Traversal
""" Definition of TreeNode: class TreeNode: def __init__(self, val): self.val = val self.left, self.right = None, None """ class Solution: """ @param: root: A Tree @return: Preorder in ArrayList which contains node values. """ def preorderTraversal(self, root): # write your code here if root is None: return [] arrLeft = self.preorderTraversal(root.left) arrRight = self.preorderTraversal(root.right) return [root.val] + arrLeft + arrRight
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【LeetCode with Python】 Binary Tree Preorder Traversal
- [LeetCode]题解（python）：105-Construct Binary Tree from Preorder and Inorder Traversal
- [leetcode]Binary Tree Preorder Traversal @ Python
- Binary Tree Preorder Traversal python
- [leetcode]Construct Binary Tree from Preorder and Inorder Traversal @ Python
- Leetcode -- Python -- Binary Tree Preorder Traversal
- [python]leetcode(105). Construct Binary Tree from Preorder and Inorder Traversal
- [Leetcode][python]Construct Binary Tree from Preorder and Inorder Traversal (Inorder and Postorder)
- [Leetcode]105. Construct Binary Tree from Preorder and Inorder Traversal@python
- 【Leetcode】【python】Binary Tree Preorder Traversal
- [Leetcode]@python 105. Construct Binary Tree from Preorder and Inorder Traversal
- leetcode [python] 【144】 Binary Tree Preorder Traversal
- LeetCode 144 — Binary Tree Preorder Traversal（C++ Java Python）
- [LeetCode]Construct Binary Tree from Preorder and Inorder Traversal@python
- [LeetCode]题解（python）：144-Binary Tree Preorder Traversal
- [leetcode] 105.Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode]105. Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode_144_Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal