二叉树查关键值.cpp

#include #include using namespace std; const int StackSize = 100; char target; class Stack { public: Stack() { top = -1; } void Push(char x) { if (top == StackSize - 1) throw "上溢"; data[++top] = x; } char Pop() { if (top == -1) throw "下溢"; char x=data[top]; top--; return x; } char GetTop() { if(top