题解 | #二叉树的前序遍历#
二叉树的前序遍历
https://www.nowcoder.com/practice/5e2135f4d2b14eb8a5b06fab4c938635
class Solution { public: vector<int> ret; stack<TreeNode*> s; TreeNode* temp=nullptr; vector<int> preorderTraversal(TreeNode* root) { // write code here if(root == nullptr) return ret; s.push(root); while(!s.empty()) { temp = s.top(); ret.push_back(temp->val); s.pop(); if(temp->right) s.push(temp->right); if(temp->left) s.push(temp->left); } return ret; } };