二叉树的非递归深度优先

二叉树的初始化问题，
深度优先，就是中序遍历，递归的话就是先左子树，再右子树，如果是非递归就借助栈数据结构，根节点入栈弹出，再右子树先入栈，左子树在入栈

#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>

using namespace std;
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) {}
	
};
// 二叉树的非递归遍历
void Dfs(TreeNode * node)
{
	if (node == nullptr) {
		cout << "空树" << endl;
		return;
	}
	stack<TreeNode*>st;
	st.push(node);
	while(!st.empty()){
		TreeNode* te = st.top();
		st.pop();
		cout << te->val << " " << endl;
		if (te->right) {
			st.push(te-> right);
		}if (te->left) {
			st.push(te->left);
		}
	}
	cout << endl;	
}
//递归
	public void depthOrderTraversalWithRecursive()
	{
		depthTraversal(root);
	}

	private void depthTraversal(TreeNode tn)
	{
		if (tn != null && !tn.equals(null))
		{
			System.out.print(tn.value + "  ");
			depthTraversal(tn.left);
			depthTraversal(tn.right);
		}
	}