Q. What is the time complexity for peeking the top element in a stack?

किसी स्टैक में शीर्ष तत्व को देखने में लगने वाली समय जटिलता क्या है?

A
O(n)
B
O(1)
C
O(log n)
D
O(n log n)

Explanation

Explanation will be available soon. Please stay tuned.

व्याख्या जल्द ही उपलब्ध होगी। कृपया बने रहें।

Invest in Future Achievers

Your support helps keep Exam Achiever 100% free for students preparing for exams.

Thanks for your support!

Comments

Leave a Comment