Consider the following statements about (2,4) trees

Consider the following statements about (2,4) trees
I) height of (2,4) tree storing n items is O(log n)
ii) Fusion operation takes constant time
iii)Deletion operation takes O(n) time
Select one:
> All of them are true
> All of them are false
> i, ii are true and iii is false
> i is true and ii, iii are false

 

This Question is not yet answered!

 
 

Related Answered Questions

 

Related Open Questions