二叉树的后序遍历的非递归实现(肯定要用栈)
-
先序遍历顺序root->left->right
-
后续遍历顺序left->right->root
-
我们在先序遍历的的非递归实现的时候变为root->right->left,然后在翻转即可或者插入的时候做相关的操作也可以。
-
#include
#include
#include
using namespace std;
struct TreeNode
{
int val;
TreeNode lChild;
TreeNode rChild;
TreeNode(int val, TreeNodel = nullptr, TreeNoder = nullptr)
{
this->val = val;
this->lChild = l;
this->rChild = r;
}
};
TreeNode *create(int intarr[], int length, int i)
{
TreeNode *node = nullptr;if (i < length && intarr[i] != -1)
{
node = new TreeNode(intarr[i]);
node->lChild = create(intarr, length, i * 2 + 1);
node->rChild = create(intarr, length, i * 2 + 2);
}
return node;
}
void houxuOrder(TreeNode *node)
{
if (node)
{houxuOrder(node->lChild); houxuOrder(node->rChild); cout << node->val << " ";
}
}
void postOrder(TreeNode *node)
{
if (node)
{
cout << node->val << " ";
postOrder(node->lChild);
postOrder(node->rChild);
}
}
/root->left->right/
void postOrderByStack(TreeNode *node)
{
stack<TreeNode *> nodeStack;
nodeStack.push(node);
while (!nodeStack.empty())
{
TreeNode *temp = nodeStack.top();
cout << temp->val << " ";
nodeStack.pop();
if (temp->rChild)
nodeStack.push(temp->rChild);
if (temp->lChild)
nodeStack.push(temp->lChild);
}
}
/left->right->root/
void houxuOrderbystack(TreeNode *node)
{
stack<TreeNode *> nodeStack;
nodeStack.push(node);
vector res;
while (!nodeStack.empty())
{
TreeNode *temp = nodeStack.top();
res.insert(res.begin(), temp->val);
nodeStack.pop();
if (temp->lChild)
nodeStack.push(temp->lChild);
if (temp->rChild)
nodeStack.push(temp->rChild);
}
for (auto x : res)
{
cout << x << " ";
}
cout << endl;
}
int main()
{
int arr[7] = { 3,9,20,-1,-1,15,7 };
TreeNode *root = create(arr, 7, 0);
houxuOrder(root);
cout << endl;
houxuOrderbystack(root);
cout << endl;
system(“pause”);
return 0;
}