騰訊校園招聘c語(yǔ)言筆試題

1、1.輸入一個(gè)鏈表的頭結(jié)點(diǎn)，從尾到頭反過(guò)來(lái)輸出每個(gè)結(jié)點(diǎn)的值。鏈表結(jié)點(diǎn)定義如下：輸入一個(gè)鏈表的頭結(jié)點(diǎn)，從尾到頭反過(guò)來(lái)輸出每個(gè)結(jié)點(diǎn)的值。鏈表結(jié)點(diǎn)定義如下：structListNodeintm_nKeyListNodem_pNextA:遞歸方法逆序輸出，棧方法逆序輸出。(任意實(shí)現(xiàn)一種既可)voidPrintListUsingRecursicve(pListNodehead)if(head!=NULL)PrintListUsingRecursic

2、ve(headm_pNext)printf(“%dn“headm_nKey)voidPrintListUsingStack(pListNodehead)Stackss.top=0pListNodep=headdopush(p=pm_pNextwhile(p!=NULL)while(!IsEmpty(2.二元樹(shù)的深度二元樹(shù)的深度題目：輸入一棵二元樹(shù)的根結(jié)點(diǎn)，求該樹(shù)的深度。從根結(jié)點(diǎn)到葉結(jié)點(diǎn)依次經(jīng)過(guò)的結(jié)點(diǎn)（含根、葉結(jié)點(diǎn)）形成樹(shù)的一條路徑，最長(zhǎng)

3、路徑的長(zhǎng)度為樹(shù)題目：輸入一棵二元樹(shù)的根結(jié)點(diǎn)，求該樹(shù)的深度。從根結(jié)點(diǎn)到葉結(jié)點(diǎn)依次經(jīng)過(guò)的結(jié)點(diǎn)（含根、葉結(jié)點(diǎn)）形成樹(shù)的一條路徑，最長(zhǎng)路徑的長(zhǎng)度為樹(shù)的深度的深度。#include#include#include#include#defineMAXLEN100#defineMAXNUM10typedefintTree[MAXLEN]TreebtintGetDeep(inti)intl=0r=0typedefintTree[MAXLEN]Treeb

4、ttypedefstructqueueintbeginendintspace[MAXLEN]Queueintmain()inti=0memset(bt1sizeof(bt))f(i=1i=MAXNUMi)bt[i]=iQueueqeqe.begin=0qe.end=0qe.space[qe.end]=bt[1]while(qe.begin!=qe.end)if(bt[2qe.space[qe.begin]]!=1)lchildqe.sp

5、ace[qe.end]=bt[2qe.space[qe.begin]]if(bt[2qe.space[qe.begin]1]!=1)rchildqe.space[qe.end]=bt[2qe.space[qe.begin]1]qe.beginprintf(“n“)f(i=0iqe.endi)printf(“%d“qe.space[i])return0先序，中序，后序三種方式的只是遍歷二元樹(shù)typedefintTree[MAXLEN]Tr