标签:result order lan UNC treenode 条件 hub https script
https://leetcode-cn.com/problems/binary-tree-preorder-traversal/description/
// Problem: LeetCode 144
// URL: https://leetcode-cn.com/problems/binary-tree-preorder-traversal/description/
// Tags: Tree Recursion Stack
// Difficulty: Medium
#include <iostream>
#include <vector>
using namespace std;
struct TreeNode{
int val;
TreeNode* left;
TreeNode* right;
TreeNode(int x):val(x), left(nullptr), right(nullptr){}
};
class Solution{
public:
void func(TreeNode* root, vector<int>& result){
if (root != nullptr){
result.push_back(root->val);
func(root->left, result);
func(root->right, result);
}
}
vector<int> preorderTraversal(TreeNode* root){
vector<int> result;
func(root, result);
return result;
}
};
int main()
{
cout << "helloworld" << endl;
// system("pause");
return 0;
}
// Problem: LeetCode 144
// URL: https://leetcode-cn.com/problems/binary-tree-preorder-traversal/description/
// Tags: Tree Recursion Stack
// Difficulty: Medium
#include <iostream>
#include <vector>
#include <stack>
using namespace std;
struct TreeNode{
int val;
TreeNode* left;
TreeNode* right;
TreeNode(int x):val(x), left(nullptr), right(nullptr){}
};
class Solution{
public:
vector<int> preorderTraversal(TreeNode* root){
vector<int> result;
stack<TreeNode*> nodes;
nodes.push(root);
while(!nodes.empty()){
root = nodes.top();
nodes.pop();
if(root!=nullptr){
result.push_back(root->val);
nodes.push(root->right);
nodes.push(root->left);
}
}
return result;
}
};
int main()
{
cout << "helloworld" << endl;
// system("pause");
return 0;
}
作者:@臭咸鱼
转载请注明出处:https://www.cnblogs.com/chouxianyu/
欢迎讨论和交流!
标签:result order lan UNC treenode 条件 hub https script
原文地址:https://www.cnblogs.com/chouxianyu/p/13290758.html