非递归
深度优先
先序遍历的核心:根左右。
12,5,4,3,9,7,6,8,11,10,17,15,20,18,21
算法流程:
1. 先申请一个栈,记为stk。
2. 然后将根节点压入stk中。
3. 每次从stk中弹出栈顶节点,记为cur,然后打印cur的值。如果cur的右子树不为空,将cur的右子树压入stk中。如果cur的左子树不为空,将cur的左子树压入stk中。不断重复次步骤3直到stk为空循环结束。
void Tree::_PreOrder()
{
stack<Node*> stk;
stk.push(root);
while (!stk.empty())
{
Node* top = stk.top();
stk.pop();
cout << top->val << " ";
if (top->right) stk.push(top->right);
if (top->left) stk.push(top->left);
}
}
类中的函数可以直接访问私有成员变量
.h
#pragma once
#include<vector>
#include<iostream>
#include<queue>
#include<stack>
using namespace std;
struct Node
{
int val;
Node* left = nullptr;
Node* right = nullptr;
Node(int val)
{
this->val = val;
}
};
class Tree
{
public:
Node* root = nullptr;
Tree(vector<int> &vec);
void Levec();
void _PreOrder();
void Inorder(Node* root)
{
if (root == nullptr)return;
Inorder(root->left);
cout << root->val << " ";
Inorder(root->right);
}
};
.cpp
#include"Tree.h"
Tree::Tree(vector<int> &vec)
{
root = new Node(vec[0]);//创建树的根节点
for (int i = 1; i < vec.size(); i++)
{
Node* p = root;
Node* node = new Node(vec[i]);
while (1)
{
if (vec[i] < p->val)
{
if (p->left == nullptr)
{
p->left = node;
break;
}
p = p -> left;
}
if (vec[i] > p->val)
{
if (p->right == nullptr)
{
p->right = node;
break;
}
p = p->right;
}
if (vec[i] == p->val)
{
break;
}
}
}
}
void Tree::_PreOrder()
{
stack<Node*> stk;
stk.push(root);
while (!stk.empty())
{
Node* top = stk.top();
stk.pop();
cout << top->val << " ";
if (top->right) stk.push(top->right);
if (top->left) stk.push(top->left);
}
}
main.cpp
#include"Tree.h"
int main()
{
vector<int> vec = { 7,5,4,6,11,9,10 };
Tree t(vec);
t._PreOrder();
}
递归
void Pre_Order(Node* root)
{
if (root == nullptr) return;
cout << root->key << " ";
Pre_Order(root->left);
Pre_Order(root->right);
}