摘要： 1 #include <iostream.h> 2 3 struct BSTreeNode 4 { 5 int m_nValue; 6 struct BSTreeNode *m_pLeft; 7 struct BSTreeNode *m_pRight; 8 }; 9 10 void addBSTreeNode(BSTreeNode *&pCurrent,int value); //建立二叉排序树11 void inOrderBSTree(BSTreeNode *pBSTree); //中序遍历12 void convertToDoubleList(BSTreeNod... 阅读全文