A.哈夫曼樹(shù)是帶權(quán)路徑長(zhǎng)度最小的二叉樹(shù)B.哈夫曼樹(shù)的葉子結(jié)點(diǎn)權(quán)值越大越靠近根結(jié)點(diǎn)C.哈夫曼樹(shù)中不存在度為1的結(jié)點(diǎn)D.哈夫曼樹(shù)的構(gòu)造過(guò)程是從小權(quán)值開(kāi)始合并E.哈夫曼樹(shù)的構(gòu)造過(guò)程是從大權(quán)值開(kāi)始合并
A.先序遍歷是先訪問(wèn)根結(jié)點(diǎn)B.中序遍歷是先訪問(wèn)左子樹(shù)C.后序遍歷是先訪問(wèn)右子樹(shù)D.層序遍歷是按層次訪問(wèn)結(jié)點(diǎn)E.先序遍歷是先訪問(wèn)左子樹(shù)
A.樹(shù)的度是樹(shù)中所有結(jié)點(diǎn)的度的最大值B.度為0的結(jié)點(diǎn)稱為葉子結(jié)點(diǎn)C.樹(shù)的深度是樹(shù)中所有結(jié)點(diǎn)的最大層數(shù)D.樹(shù)中結(jié)點(diǎn)的層數(shù)從0開(kāi)始計(jì)算E.樹(shù)的根結(jié)點(diǎn)沒(méi)有雙親結(jié)點(diǎn)