LeetCode | 145. Binary Tree Postorder Traversal
題目:
Given the root
of a binary tree, return the postorder traversal of its nodes' values.
Example 1:
Input: root = [1,null,2,3] Output: [3,2,1]
Example 2:
Input: root = [] Output: []
Example 3:
Input: root = [1] Output: [1]
Example 4:
Input: root = [1,2] Output: [2,1]
Example 5:
Input: root = [1,null,2] Output: [2,1]
Constraints:
- The number of the nodes in the tree is in the range
[0, 100]
. -100 <= Node.val <= 100
Follow up:
Recursive solution is trivial, could you do it iteratively?
程式碼:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void backPostorder(TreeNode* root, vector<int>& res) {
if(root == NULL)
return;
backPostorder(root->left, res);
backPostorder(root->right, res);
res.push_back(root->val);
return;
}
vector<int> postorderTraversal(TreeNode* root) {
vector<int> res;
if(root == NULL)
return res;
backPostorder(root, res);
return res;
}
};
相關文章
- Leetcode 145. Binary Tree Postorder TraversalLeetCode
- 【LeetCode】145. Binary Tree Postorder Traversal (3 solutions)LeetCode
- Leetcode Binary Tree Postorder TraversalLeetCode
- Leetcode-Binary Tree Postorder TraversalLeetCode
- Binary Tree Postorder Traversal leetcode javaLeetCodeJava
- LeetCode145:Binary Tree Postorder TraversalLeetCode
- Construct Binary Tree from Inorder and Postorder Traversal Traversal leetcode javaStructLeetCodeJava
- Leetcode-145題:Binary Tree Postorder TraversalLeetCode
- Leetcode Construct Binary Tree from Inorder and Postorder TraversalLeetCodeStruct
- Construct Binary Tree from Inorder and Postorder TraversalStruct
- Leetcode 106. Construct Binary Tree from Inorder and Postorder TraversalLeetCodeStruct
- leetcode - Binary Tree Preorder TraversalLeetCode
- Leetcode Binary Tree Inorder TraversalLeetCode
- Leetcode Binary Tree Preorder TraversalLeetCode
- Binary Tree Level Order Traversal [LEETCODE]LeetCode
- [leetcode]binary-tree-inorder-traversalLeetCode
- Leetcode Binary Tree Level Order TraversalLeetCode
- Leetcode-Binary Tree Inorder TraversalLeetCode
- Binary Tree Inorder Traversal leetcode javaLeetCodeJava
- Binary Tree Preorder Traversal leetcode javaLeetCodeJava
- LeetCode 94 [Binary Tree Inorder Traversal]LeetCode
- Leetcode 94. Binary Tree Inorder TraversalLeetCode
- LeetCode-Binary Tree Vertical Order TraversalLeetCode
- Leetcode Binary Tree Level Order Traversal IILeetCode
- Leetcode-Binary Tree Level Order TraversalLeetCode
- Binary Tree Level Order Traversal leetcode javaLeetCodeJava
- LeetCode | 144. Binary Tree Preorder TraversalLeetCode
- Leetcode 144. Binary Tree Preorder TraversalLeetCode
- LeetCode144:Binary Tree Preorder TraversalLeetCode
- Leetcode Binary Tree Zigzag Level Order TraversalLeetCode
- Leetcode-Binary Tree Level Order Traversal IILeetCode
- Binary Tree Level Order Traversal II leetcode javaLeetCodeJava
- Leetcode-Construct Binary Tree from inorder and postorder travesalLeetCodeStruct
- leetcode [python] 【144】 Binary Tree Preorder TraversalLeetCodePython
- Leetcode Construct Binary Tree from Preorder and Inorder TraversalLeetCodeStruct
- Leetcode-binary Tree Zigzag Level Order TraversalLeetCode
- Binary Tree ZigZag Level Order Traversal leetcode javaLeetCodeJava
- LeetCode 272 Closest Binary Tree Traversal II 解題思路LeetCode