Computer Science · Data Structures
एक ऐरे (array) का उपयोग करके कार्यान्वित स्टैक में Push() ऑपरेशन की समय जटिलता (time complexity) क्या होती है, यह मानते हुए कि आकार बदलने (resizing) की आवश्यकता नहीं है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(log n)
- 2O(n2)
- 3O(1)✓
- 4O(n)
सही उत्तर देखें
O(1)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures