摘要:
头文件:#include <stdio.h>struct BinaryTreeNode { int m_nValue; BinaryTreeNode* m_pLeft; BinaryTreeNode* m_pRight; };先序输入建立:void Create_BT(BinaryTreeNode *&bt)//先序输入二叉树{ int d; scanf("%d",&d); if(d==-1)bt=NULL; else { bt=(BinaryTreeNode*)malloc(sizeof(Binar... 阅读全文