N叉树的前序遍历
题目描述
给定一个n叉树的根节点 root ,返回 其节点值的前序遍历 。n叉树在输中按层序遍历进行序列化表示,每组子节点由空值 null 分隔。
示例一
输入:root = [1,null,3,2,4,null,5,6]
输出:[1,3,5,6,2,4]
示例二
输入:root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
输出:[1,2,3,6,7,11,14,4,8,12,5,9,13,10]
方法一
树的遍历很容易想到
递归法
.N叉树遍历 可以类比于 二叉树遍历.
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val) {
val = _val;
}
Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public:
vector<int> preorder(Node* root) {
vector<int> res;
dfs(root, res);
return res;
}
void dfs(Node* root, vector<int> & res) {
if (root == nullptr) {
return;
}
res.push_back(root->val);
vector<Node*> children = root->children;
if (children.size() > 0) { // 相比二叉树遍历子树的区别
for (auto tmp : children) {
dfs(tmp, res);
}
}
}
};
方法二
迭代法,使用栈去模拟递归。
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val) {
val = _val;
}
Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public:
vector<int> preorder(Node* root) {
vector<int> res;
if (root == nullptr){
return res;
}
stack<Node*> st;
st.push(root);
while (!st.empty()){
Node* tmp = st.top();
st.pop();
res.push_back(tmp->val);
vector<Node*> children = tmp->children;
for (int i = children.size() -1; i >= 0; i--) {//栈的特性先进后出,所以从右开始遍历
st.push(children[i]);
}
}
return res;
}
};