When poll is active respond at
PollEv.com​/pds
Send
pds
to
22333
Consider implementing a PrQUE with an AVL tree. What is the worst case time complexity of "enq" on such a PrQUE with N items in it?
184
2%
4
O(1)
86%
158
O(log N)
8%
14
O(N)
4%
7
O(N log N)
1%
1
O(N^2)
0%
0
O(2^N)
See more
Powered by