标签：
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].
Solution 1: (递归)
/** * 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: vector<int> preorderTraversal(TreeNode* root) { if(root != NULL) { v.push_back(root->val); preorderTraversal(root->left); preorderTraversal(root->right); } return v; } private: vector<int> v; };
Solution 2: (非递归)
Binary Tree Preorder Traversal -- LeetCode 144
标签：
原文地址：http://www.cnblogs.com/xuyan505/p/5381906.html
