Whichoperationsoflinkedlistaremoreefficientthanarraybasedlist?

Whichoneisnotcorrect?

Givenaqueue{1,2,3,4,5},where1isthefrontand5istherear.Whatwillbethequeuechangedtoafterexecutingthefollowingoperations:enqueue(8),dequeue(),dequeue(),enqueue(9),dequeue(),dequeue(),dequeue(),enqueue(10),

ABSTmustbeafullbinarytree?

ThetimecosttosearchavalueinaBSTisalwaysΘ(logn)inaveragecase?

盘

ThetimecosttoinsertonenodeonabalancedBSTisΘ(logn)inaveragecase?

Aheapmustbeacompletebinarytree

Aheapmustbeafullbinarytree

Givenasortedarraycontainingnelements,thetimecostofbinarysearchisΘ(___)inaveragecase.

ThetimecosttoinsertoneelementintoasortedarrayisΘ(___)inaveragecase.

Thetimecosttoinsertorremoveoneelementinalinearindexis:

Afterinserttheelements(8,10,30,5,15,2,20)intoanempty2-3treeonebyone,thedepthofthenodecontaining10is_________

2-3treeisalwaysbalanced?

Btreeisalwaysbalanced

2-3treeisakindofspecialBtree