风之城的非递归中序遍历二叉树
// C++ program to print inorder traversal
// using stack.
#include<bits/stdc++.h>
using namespace std;
struct Node
{
int data;
struct Node* left;
struct Node* right;
Node (int data)
{
this->data = data;
left = right = NULL