Binary Tree Postorder Traversal - LeetCode
class Solution {
func postorderTraversal(_ root: TreeNode?) -> [Int] {
guard let root = root else {
return []
}
return postorderTraversal(root.left) + postorderTraversal(root.right) + [root.val]
}
}
Binary Tree Postorder Traversal - LeetCode Solution 树
LeetCode 145. Binary Tree Postorder Traversal Description...
145. Binary Tree Postorder Traversal 题目: https://leetcode...
https://leetcode-cn.com/problems/binary-tree-postorder-tr...
原题地址：https://leetcode.com/problems/binary-tree-postorder-...
题目地址 https://leetcode.com/problems/binary-tree-postorder-...
Binary Tree Postorder Traversal Given a binary tree, retu...
145. Binary Tree Postorder Traversal Given a binary tree,...
title: binary-tree-postorder-traversal 描述 Given a binary ...
Binary Tree Postorder Traversal Serialize and Deserialize...
本文标题：LeetCode - Binary Tree Postorder
本文链接：https://www.haomeiwen.com/subject/jffslctx.html
网友评论