. . . 一算法设计题 1. 设二叉树bt采用二叉链表结构存储试设计一个算法输出二叉树中所有非叶子结点并求出非叶子结点的个数 答案 int count=0; void algo2(BTNode *bt){ if (bt){ if(bt->lchild || bt->rchild){ printf(bt->data; count++; } algo2(bt->lchild; algo2(bt->r