Gate Exam Programming Technical

Which method is used by binary search tree ?
1- Dynamic programming
2-Divide and concquer
3- greedy algorithms
4- Broute force

Read Solution (Total 6)

Gate Other Question

Which algorithm will perform better ? O(n^2) or O(n^3)

1. O(n^2)
2. O(n^3)
3. Depends upon problem instance.
4. Can't say.
gate gate etag gatge