ISRO CS-2023
August 29, 2024ISRO CS-2023
August 29, 2024ISRO CS-2023
Question 41 |
Time complexity to find the diameter of a binary tree having n nodes is
O(n2) | |
O(n)
| |
O(1)
| |
O(log n) |
Correct Answer: A
Subscribe
Login
0 Comments