/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> preorderTraversal(TreeNode* root)
{
stack<TreeNode*> st;
vector<int> res;
if (root == NULL) return res;
st.push(root);
while (!st.empty())
{
TreeNode* node = st.top();
st.pop();
res.push_back(node->val);
if (node->right != NULL) st.push(node->right);
if (node->left != NULL) st.push(node->left);
}
return res;
}
};
LeetCode144. 二叉树的前序遍历(非递归实现)
最新推荐文章于 2024-08-10 07:14:43 发布