C++ 二叉树的遍历 前序 中序 后序 递归&非递归 层次

#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <math.h>
using namespace std;

typedef int datatype;

class Node {
public:
	datatype val;
	Node* left;
	Node* right;

	Node(datatype val) {
		this->val = val;
		left = nullptr;
		right = nullptr;
	}
};

//创建一棵二叉树 
//输入 # 以终止当前结点的某个子结点创建 
Node* create_tree() {
	string tmp;
	Node* root = nullptr;
	cin >> tmp;
	if (tmp != "#") {
		root = new Node(stoi(tmp));
		root->left = create_tree();
		root->right = create_tree();
	}
	return root;
}


//构造 depth 层的满二叉树 
Node* create_full_bintree(int depth) {
	if (depth < 1) {
		cout << "error input of depth." << endl;
		return nullptr;
	}
	queue<Node*> q;
	int val = 1;
	Node* root = new Node(val++);
	Node* cur;
	q.push(root);
	while (val < pow(2, depth) - 1) {
		cur = q.front();
		q.pop();
		cur->left &