关键:叶子节点的左右子树都为空
void PrintLeaves(BinTree BT) { if(BT) { if(!BT->Left && !BT->Right) //如果BT节点是叶子 printf("%d", BT->Data); PrintLeaves(BT->Left); PrintLeaves(BT->Right); } }
关键:叶子节点的左右子树都为空
void PrintLeaves(BinTree BT) { if(BT) { if(!BT->Left && !BT->Right) //如果BT节点是叶子 printf("%d", BT->Data); PrintLeaves(BT->Left); PrintLeaves(BT->Right); } }
转载于:https://www.cnblogs.com/FengZeng666/p/9728158.html