A.二叉樹(shù)是每個(gè)節(jié)點(diǎn)最多有兩個(gè)子樹(shù)的樹(shù)結(jié)構(gòu)
B.通常子樹(shù)被稱作“左子樹(shù)”(leftsubtree)和“右子樹(shù)”(rightsubtree)
C.二叉樹(shù)常被用于實(shí)現(xiàn)二叉查找樹(shù)和二叉堆
D.二叉樹(shù)的子樹(shù)有左右之分,次序可以顛倒
A.Set、List
B.Map
C.ArrayList
D.Vector