今天写了一道力扣上面中序遍历二叉树的题,题目给的函数格式是这样的
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
}
};
要求返回一个动态数组,跟之前写过的void型函数直接打印很不同,那种方法直接用递归,于是我也首先想到的是递归
递归解法
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
#include<vector>
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> result;
InOrder(root, &result);
return result;
}
void InOrder(TreeNode *root, vector<int> *v){
if(root==NULL) return;
InOrder(root->left,v);
v->push_back(root->val);
InOrder(root->right,v);
}
};
非递归解法
法一
while循环,利用stack,一直向左走,把node全入栈,走到尽头之后,再依次去处理栈里面的结点,对每个结点的处理是:把它的值放入数组,然后处理右孩子,以此循环,知道栈空,即为所有结点处理完了
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> result;
stack<TreeNode*> stack;
while (1) {
while (root) {
stack.push(root);
root = root->left;
}
if (stack.empty()) break;
root = stack.top();
stack.pop();
result.push_back(root->val);
root = root->right;
}
}
};