Forwarded from Algochallenges
Balanced binary tree with n items allows the lookup of an item in ____ worst-case time.
Anonymous Quiz
41%
O(logn)
32%
O(nlog2)
24%
O(n)
3%
O(1)
Forwarded from Algochallenges
Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in x time.
Anonymous Quiz
44%
O(m+n)
23%
O(mn)
6%
O(m)
27%
O(mlogn)