📊 Data Structure (DS)
Q. 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)
💬 Discuss
✅ Correct Answer: (D) h = O(log n)

You must be Logged in to update hint/solution

💬 Discussion

Related MCQs

Q. Files that can store data in the same format as used in program are called

Q. Set of processes involved in creating or determining the strategies of the organization is called:

Q. Formal communication may take place between

Q. Next-Hop Method is used to reduce contents of a

Q. In frame relay networks, extended address is used _______

Q. register is used for the purpose of controlling the status of each interrupt request in parallel priority interrupt.

Q. Gateway to the Internet optimized for mobility

Q. the truth table for exclusive disjunction will be

Q. Which of the following is true about Ridge or Lasso regression methods in case of feature selection?

Q. The ____________ directive ensures that a specific memory location is updated atomically, rather than exposing it to the possibility of multiple, simu

📊 Question Analytics

👁️
812
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
92%
Success Rate