C/C++ code/*************************************************************
*
* operate BitTree
*
************************************************************/
#include
#include
#include
typedef struct BitNode
{
char ele;
struct BitNode *lchild;
struct BitNode *rchild;
}*BitTree;
typedef struct stack
{
BitTree BTP;
struct stack *next;
}*stackP;
int i=0;
//according to picture 6.8
char bitTreeArr[]={'A','B','C','#','#','D','E','#','G','#','#','F','#','#','#'};
void FinOrderTraverse(BitTree p)
{
if(p!=NULL)
{
FinOrderTraverse(p->lchild);
FinOr