Binary Tree Inorder Traversal

Posted 2022-09-03 hujianglang

typedef char ElemType;

typedef struct BiTreeNode

    ElemType data;
    struct BiTreeNode *left;
    struct BiTreeNode *right;
BiTreeNode,*BiTree;

Binary Tree Inorder Traversal
void InOrderBiTree(BiTree T)
    if(T == NULL)
        return;
        
   InOrderBiTree(T->left);
   printf("%c",T->data);
   InOrderBiTree(T->right);