首页 > 代码库 > Binary Tree Preorder Traversal
Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes‘ values.
For example:
Given binary tree {1,#,2,3},
1 2 / 3
return [1,2,3].
二叉树前序遍历的非递归版本，C++实现代码：
#include<iostream>#include<new>#include<vector>#include<stack>using namespace std;//Definition for binary treestruct TreeNode{ int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {}};class Solution{public: vector<int> preorderTraversal(TreeNode *root) { stack<TreeNode*> s; vector<int> vec; if(root==NULL) return vector<int>(); while(root||!s.empty()) { while(root) { s.push(root); vec.push_back(root->val); root=root->left; } if(!s.empty()) { root=s.top(); s.pop(); root=root->right; } } return vec; } void createTree(TreeNode *&root) { int i; cin>>i; if(i!=0) { root=new TreeNode(i); if(root==NULL) return; createTree(root->left); createTree(root->right); } }};int main(){ Solution s; TreeNode *root; s.createTree(root); vector<int> path=s.preorderTraversal(root); for(auto a:path) { cout<<a<<" "; } cout<<endl;}
Binary Tree Preorder Traversal
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。