What is the average case time complexity for finding the height of the binary tree? Q & A › Category: Data Structure › What is the average case time complexity for finding the height of the binary tree? 0 Vote Up Vote Down Admin Staff asked 4 years ago What is the average case time complexity for finding the height of the binary tree? a) h = O(loglogn) b) h = O(nlogn) c) h = O(n) d) h = O(log n) Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading... 1 Answers 0 Vote Up Vote Down Admin Staff answered 4 years ago d) h = O(log n) Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading...
Admin