/**
* 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) {
vector<int> res;
TreeNode * t = root;
preorder(t, res);
return res;
}
void preorder(TreeNode* t, vector<int> & res) {
if(t){
res.push_back(t -> val);
preorder(t -> left, res);
preorder(t -> right, res);
}
return;
}
};
leetcode+144. Binary Tree Preorder Traversal+前序遍历+注意vector好存储
最新推荐文章于 2024-07-21 15:36:00 发布