treeabc.h

中序线索化的二叉树 能够对二叉树先线索化然后再中序排列 并且输出

#pragma once
typedef enum PointerTag {Link, Thread};

struct AVLTree
{
     int nData;
     struct AVLTree* pLeft;
     struct AVLTree* pRight;
     int nHeight;
     PointerTag LTag, RTag;
     AVLTree(int & v = int(), AVLTree* pLeft_ = 0, AVLTree* pRight_ = 0)
    : nData(v), pLeft(pLeft_), pRight(pRight_) { }
};