LeetCode-144-Binary Tree Preorder Traversal
Posted 无名路人甲
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode-144-Binary Tree Preorder Traversal相关的知识,希望对你有一定的参考价值。
算法描述:
Given a binary tree, return the preorder traversal of its nodes‘ values.
Example:
Input:[1,null,2,3]
1 2 / 3 Output:[1,2,3]
Follow up: Recursive solution is trivial, could you do it iteratively?
解题思路:先根非递归遍历。
vector<int> preorderTraversal(TreeNode* root) { vector<int> results; stack<TreeNode*> stk; while(root!=nullptr || !stk.empty()){ while(root!=nullptr){ stk.push(root); results.push_back(root->val); root=root->left; } TreeNode* temp = stk.top(); stk.pop(); if(temp->right!=nullptr) root = temp->right; } return results; }
以上是关于LeetCode-144-Binary Tree Preorder Traversal的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode 144. Binary Tree Preorder Traversal
[leetcode-144-Binary Tree Preorder Traversal]
LeetCode-144-Binary Tree Preorder Traversal
leetcode [144]Binary Tree Preorder Traversal