二叉樹(shù)找到指定節(jié)點(diǎn)的路徑 c語(yǔ)言統(tǒng)計(jì)二叉樹(shù)的葉節(jié)點(diǎn)個(gè)數(shù)，并輸出每個(gè)葉節(jié)點(diǎn)到根結(jié)點(diǎn)的路徑？
c語(yǔ)言統(tǒng)計(jì)二叉樹(shù)的葉節(jié)點(diǎn)個(gè)數(shù)，并輸出每個(gè)葉節(jié)點(diǎn)到根結(jié)點(diǎn)的路徑？typedef char keytypedef struct Node{KeyType key struct Node*lchild，*r
c語(yǔ)言統(tǒng)計(jì)二叉樹(shù)的葉節(jié)點(diǎn)個(gè)數(shù)，并輸出每個(gè)葉節(jié)點(diǎn)到根結(jié)點(diǎn)的路徑？
typedef char keytypedef struct Node{KeyType key struct Node*lchild，*rchild}BTNode，*BTreechar Paths[20]void OutPutPath（）{printf（%sn，Paths）}void LeavesPath（BTree tree，int level）{if（tree==NULL）return Paths[level]=tree->key if（（tree->lchild==NULL）&&（tree->rchild==NULL））{Paths[level 1]=“0”O(jiān)utPutPath（）return}LeavesPath（tree->lchild，level 1）LeavesPath（tree->rchild，level 1）}