...
ISRO CS-2023
August 29, 2024
ISRO CS-2023
August 29, 2024
ISRO CS-2023
August 29, 2024
ISRO CS-2023
August 29, 2024

ISRO CS-2023

Question 41
Time complexity to find the diameter of a binary tree having n nodes is
A
O(n2)

B
O(n)
C
O(1)
D
O(log n)
Correct Answer: A
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!