二叉树先序输出叶结点

void PreorderPrintLeaves(BinTree BT)
{
    if (BT == NULL)
    {
        return 0;
    }
    else
    {
        if (BT->Left == NULL && BT->Right == NULL)
        {
            printf(" %c", BT->Data);
            return 0;
        }
        PreorderPrintLeaves(BT->Left);  // 判断左边；
        PreorderPrintLeaves(BT->Right); // 判断右边；
    }
}