{"id":21055,"date":"2026-09-27T06:31:35","date_gmt":"2026-09-26T23:31:35","guid":{"rendered":"https:\/\/man2kulonprogo.sch.id\/m2kp\/?p=21055"},"modified":"2026-09-27T06:31:35","modified_gmt":"2026-09-26T23:31:35","slug":"tumpukan-stack-dan-antrean-queue","status":"publish","type":"post","link":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/","title":{"rendered":"Tumpukan (Stack) dan Antrean (Queue)"},"content":{"rendered":"

Informatika Kelas X \u2014 Bab 2<\/h2>\n

Bagian D: Tumpukan (Stack) dan Antrean (Queue)<\/h3>\n
\n

\ud83c\udfaf Tujuan Pembelajaran<\/h3>\n

Setelah mempelajari materi ini, siswa diharapkan mampu:<\/p>\n

    \n
  1. Menjelaskan konsep dan karakteristik Stack (Tumpukan) dan Queue (Antrean).<\/li>\n
  2. Membedakan prinsip kerja LIFO (Stack) dan FIFO (Queue).<\/li>\n
  3. Mengidentifikasi operasi dasar pada Stack dan Queue.<\/li>\n
  4. Memberikan contoh penerapan Stack dan Queue dalam kehidupan sehari-hari dan teknologi.<\/li>\n<\/ol>\n
    \n

    1. Pengantar<\/span><\/h3>\n

    Dalam kehidupan sehari-hari, kita sering menyusun atau mengelola data dengan urutan tertentu. Misalnya, tumpukan piring di dapur atau antrean orang membeli tiket. Kedua situasi ini ternyata memiliki konsep yang sama dengan struktur data di dunia komputer, yaitu Stack (Tumpukan)<\/strong> dan Queue (Antrean)<\/strong>.<\/p>\n

    Stack dan Queue adalah struktur data linear<\/strong>, artinya data disusun secara berurutan, tetapi cara mengakses datanya berbeda satu sama lain.<\/p>\n

    \n

    2. Tumpukan (Stack)<\/span><\/h3>\n

    2.1 Konsep Dasar<\/h4>\n

    Stack adalah struktur data yang menerapkan prinsip LIFO (Last In, First Out)<\/strong> \u2014 data yang terakhir dimasukkan<\/strong> adalah data yang pertama kali diambil\/dikeluarkan<\/strong>.<\/p>\n

    \ud83d\udccc Analogi:<\/em> Tumpukan piring. Piring yang terakhir diletakkan di atas adalah piring yang pertama diambil.<\/p>\n\n\n\n\n\n
    Piring 3 (diambil pertama)<\/td>\n<\/tr>\n
    Piring 2<\/td>\n<\/tr>\n
    Piring 1 (diletakkan pertama)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

    Panah masuk\/keluar berada di atas tumpukan (TOP).<\/em><\/p>\n

    2.2 Operasi Dasar pada Stack<\/h4>\n\n\n\n\n\n\n\n
    Operasi<\/th>\nFungsi<\/th>\n<\/tr>\n
    Push<\/strong><\/td>\nMenambahkan data baru ke bagian atas (top) tumpukan<\/td>\n<\/tr>\n
    Pop<\/strong><\/td>\nMengambil\/menghapus data dari bagian atas tumpukan<\/td>\n<\/tr>\n
    Peek \/ Top<\/strong><\/td>\nMelihat data teratas tanpa menghapusnya<\/td>\n<\/tr>\n
    isEmpty<\/strong><\/td>\nMemeriksa apakah tumpukan kosong<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

    2.3 Ilustrasi Proses Stack<\/h4>\n
    Push(A) \u2192 [A]\r\nPush(B) \u2192 [A, B]\r\nPush(C) \u2192 [A, B, C]   \u2190 C berada di posisi TOP\r\nPop()   \u2192 [A, B]      \u2190 C keluar duluan\r\n<\/pre>\n
    2.4 Contoh Penerapan Stack<\/h4>\n
      \n
    • Tombol Undo<\/strong> pada aplikasi pengolah kata (aksi terakhir dibatalkan lebih dulu).<\/li>\n
    • Tombol Back<\/strong> pada browser (halaman terakhir yang dikunjungi ditampilkan lebih dulu).<\/li>\n
    • Proses pemanggilan fungsi (call stack)<\/strong> dalam pemrograman.<\/li>\n
    • Fitur redo\/undo<\/strong> pada aplikasi desain grafis.<\/li>\n<\/ul>\n
      \n
      3. Antrean (Queue)<\/span><\/h3>\n
      3.1 Konsep Dasar<\/h4>\n
      Queue adalah struktur data yang menerapkan prinsip FIFO (First In, First Out)<\/strong> \u2014 data yang pertama dimasukkan<\/strong> adalah data yang pertama kali diambil\/dikeluarkan<\/strong>.<\/p>\n
      \ud83d\udccc Analogi:<\/em> Antrean membeli tiket bioskop. Orang yang datang pertama akan dilayani lebih dulu.<\/p>\n\n\n\n
      Orang 4
      \n(REAR – masuk)<\/small><\/td>\n      		Orang 3<\/td>\nOrang 2<\/td>\nOrang 1
      \n(FRONT – keluar)<\/small><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
      3.2 Operasi Dasar pada Queue<\/h4>\n\n\n\n\n\n\n\n
      Operasi<\/th>\nFungsi<\/th>\n<\/tr>\n
      Enqueue<\/strong><\/td>\nMenambahkan data baru ke bagian belakang (rear) antrean<\/td>\n<\/tr>\n
      Dequeue<\/strong><\/td>\nMengambil\/menghapus data dari bagian depan (front) antrean<\/td>\n<\/tr>\n
      Peek \/ Front<\/strong><\/td>\nMelihat data paling depan tanpa menghapusnya<\/td>\n<\/tr>\n
      isEmpty<\/strong><\/td>\nMemeriksa apakah antrean kosong<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
      3.3 Ilustrasi Proses Queue<\/h4>\n
      Enqueue(A) \u2192 [A]\r\nEnqueue(B) \u2192 [A, B]\r\nEnqueue(C) \u2192 [A, B, C]   \u2190 A berada di posisi FRONT\r\nDequeue()  \u2192 [B, C]      \u2190 A keluar duluan (yang pertama masuk)\r\n<\/pre>\n
      3.4 Contoh Penerapan Queue<\/h4>\n
        \n
      • Antrean cetak dokumen (print queue)<\/strong> pada printer.<\/li>\n
      • Antrean pelanggan di kasir<\/strong> atau loket layanan<\/strong>.<\/li>\n
      • Sistem antrean chat\/tiket<\/strong> layanan pelanggan online.<\/li>\n
      • Pengelolaan proses pada sistem operasi<\/strong> (penjadwalan tugas\/CPU scheduling).<\/li>\n<\/ul>\n
        \n
        4. Perbandingan Stack dan Queue<\/span><\/h3>\n\n\n\n\n\n\n\n\n\n
        Aspek<\/th>\nStack (Tumpukan)<\/th>\nQueue (Antrean)<\/th>\n<\/tr>\n
        Prinsip<\/td>\nLIFO (Last In, First Out)<\/td>\nFIFO (First In, First Out)<\/td>\n<\/tr>\n
        Titik masuk data<\/td>\nTop<\/td>\nRear (belakang)<\/td>\n<\/tr>\n
        Titik keluar data<\/td>\nTop<\/td>\nFront (depan)<\/td>\n<\/tr>\n
        Operasi utama<\/td>\nPush, Pop<\/td>\nEnqueue, Dequeue<\/td>\n<\/tr>\n
        Analogi<\/td>\nTumpukan piring<\/td>\nAntrean tiket<\/td>\n<\/tr>\n
        Contoh penerapan<\/td>\nUndo\/redo, back browser<\/td>\nAntrean cetak, antrean loket<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
        \n
        5. Rangkuman<\/span><\/h3>\n
          \n
        • Stack (Tumpukan)<\/strong> bekerja dengan prinsip LIFO<\/strong>: data terakhir masuk, pertama keluar. Operasi utamanya adalah push<\/strong> dan pop<\/strong>.<\/li>\n
        • Queue (Antrean)<\/strong> bekerja dengan prinsip FIFO<\/strong>: data pertama masuk, pertama keluar. Operasi utamanya adalah enqueue<\/strong> dan dequeue<\/strong>.<\/li>\n
        • Kedua struktur data ini banyak digunakan dalam kehidupan sehari-hari maupun dalam sistem komputer, seperti pengelolaan proses, antrean cetak, dan fitur undo pada aplikasi.<\/li>\n<\/ul>\n
          \n
          \ud83d\udcdd Tugas Siswa<\/span><\/h3>\n
          Tugas: Identifikasi Stack dan Queue dalam Kehidupan Sehari-hari<\/strong><\/p>\n
          Amati lingkungan di sekitarmu (rumah, sekolah, atau tempat umum lainnya), lalu:<\/p>\n
            \n
          1. Tuliskan 2 contoh kegiatan\/benda<\/strong> yang menerapkan prinsip Stack (LIFO)<\/strong>.<\/li>\n
          2. Tuliskan 2 contoh kegiatan\/benda<\/strong> yang menerapkan prinsip Queue (FIFO)<\/strong>.<\/li>\n
          3. Untuk setiap contoh, jelaskan secara singkat mengapa<\/strong> contoh tersebut termasuk Stack atau Queue (kaitkan dengan urutan masuk dan keluarnya).<\/li>\n<\/ol>\n
            Kumpulkan jawabanmu dalam bentuk tabel sederhana seperti contoh berikut:<\/em><\/p>\n\n\n\n\n\n
            No<\/th>\nContoh<\/th>\nJenis (Stack\/Queue)<\/th>\nAlasan<\/th>\n<\/tr>\n
            1<\/td>\n…<\/td>\n…<\/td>\n…<\/td>\n<\/tr>\n
            2<\/td>\n…<\/td>\n…<\/td>\n…<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"
            Informatika Kelas X \u2014 Bab 2 Bagian D: Tumpukan (Stack) dan Antrean (Queue) \ud83c\udfaf Tujuan Pembelajaran Setelah mempelajari materi ini, siswa diharapkan mampu: Menjelaskan konsep dan karakteristik Stack (Tumpukan) dan Queue (Antrean). Membedakan prinsip kerja LIFO (Stack) dan FIFO (Queue). Mengidentifikasi operasi dasar pada Stack dan Queue. Memberikan contoh penerapan Stack dan Queue dalam kehidupan …<\/p>\n","protected":false},"author":1,"featured_media":21056,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1582],"tags":[1967,1969,1968,1966],"class_list":["post-21055","post","type-post","status-publish","format-standard","has-post-thumbnail","","category-informatika-kelas-x","tag-antrian","tag-queue","tag-stack","tag-tumpukan"],"yoast_head":"\nTumpukan (Stack) dan Antrean (Queue) - MAN 2 KULON PROGO<\/title>\n<meta name=\"description\" content=\"Dalam kehidupan sehari-hari, kita sering menyusun atau mengelola data dengan urutan tertentu. Misalnya, tumpukan piring di dapur atau antrean orang membeli tiket. Kedua situasi ini ternyata memiliki konsep yang sama dengan struktur data di dunia komputer, yaitu Stack (Tumpukan) dan Queue (Antrean).Stack dan Queue adalah struktur data linear, artinya data disusun secara berurutan, tetapi cara mengakses datanya berbeda satu sama lain.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/\" \/>\n<meta property=\"og:locale\" content=\"id_ID\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Tumpukan (Stack) dan Antrean (Queue) - MAN 2 KULON PROGO\" \/>\n<meta property=\"og:description\" content=\"Dalam kehidupan sehari-hari, kita sering menyusun atau mengelola data dengan urutan tertentu. Misalnya, tumpukan piring di dapur atau antrean orang membeli tiket. Kedua situasi ini ternyata memiliki konsep yang sama dengan struktur data di dunia komputer, yaitu Stack (Tumpukan) dan Queue (Antrean).Stack dan Queue adalah struktur data linear, artinya data disusun secara berurutan, tetapi cara mengakses datanya berbeda satu sama lain.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/\" \/>\n<meta property=\"og:site_name\" content=\"MAN 2 KULON PROGO\" \/>\n<meta property=\"article:published_time\" content=\"2026-09-26T23:31:35+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-content\/uploads\/2026\/09\/featured-stack-queue.png\" \/>\n\t<meta property=\"og:image:width\" content=\"1200\" \/>\n\t<meta property=\"og:image:height\" content=\"630\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"Irawan\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Ditulis oleh\" \/>\n\t<meta name=\"twitter:data1\" content=\"Irawan\" \/>\n\t<meta name=\"twitter:label2\" content=\"Estimasi waktu membaca\" \/>\n\t<meta name=\"twitter:data2\" content=\"4 menit\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/\"},\"author\":{\"name\":\"Irawan\",\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/#\\\/schema\\\/person\\\/fe583cc282ca35c3ee3aba623726d784\"},\"headline\":\"Tumpukan (Stack) dan Antrean (Queue)\",\"datePublished\":\"2026-09-26T23:31:35+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/\"},\"wordCount\":563,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/#organization\"},\"image\":{\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/wp-content\\\/uploads\\\/2026\\\/09\\\/featured-stack-queue.png\",\"keywords\":[\"antrian\",\"queue\",\"stack\",\"tumpukan\"],\"articleSection\":[\"Informatika Kelas X\"],\"inLanguage\":\"id\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/\",\"url\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/\",\"name\":\"Tumpukan (Stack) dan Antrean (Queue) - MAN 2 KULON PROGO\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/wp-content\\\/uploads\\\/2026\\\/09\\\/featured-stack-queue.png\",\"datePublished\":\"2026-09-26T23:31:35+00:00\",\"description\":\"Dalam kehidupan sehari-hari, kita sering menyusun atau mengelola data dengan urutan tertentu. Misalnya, tumpukan piring di dapur atau antrean orang membeli tiket. Kedua situasi ini ternyata memiliki konsep yang sama dengan struktur data di dunia komputer, yaitu Stack (Tumpukan) dan Queue (Antrean).Stack dan Queue adalah struktur data linear, artinya data disusun secara berurutan, tetapi cara mengakses datanya berbeda satu sama lain.\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/#breadcrumb\"},\"inLanguage\":\"id\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"id\",\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/#primaryimage\",\"url\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/wp-content\\\/uploads\\\/2026\\\/09\\\/featured-stack-queue.png\",\"contentUrl\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/wp-content\\\/uploads\\\/2026\\\/09\\\/featured-stack-queue.png\",\"width\":1200,\"height\":630},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/2026\\\/09\\\/27\\\/tumpukan-stack-dan-antrean-queue\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Beranda\",\"item\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Tumpukan (Stack) dan Antrean (Queue)\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/#website\",\"url\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/\",\"name\":\"MAN 2 KULON PROGO\",\"description\":\"Terwujudnya Insan yang Berakhlak Mulia, Unggul, Terampil, Inovatif, dan Berwawasan Lingkungan, Bebas dari Korupsi dan Bersih Melayani\",\"publisher\":{\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"id\"},{\"@type\":\"Organization\",\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/#organization\",\"name\":\"MAN 2 KULON PROGO\",\"url\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"id\",\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/#\\\/schema\\\/logo\\\/image\\\/\",\"url\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/wp-content\\\/uploads\\\/2020\\\/12\\\/logo.png\",\"contentUrl\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/wp-content\\\/uploads\\\/2020\\\/12\\\/logo.png\",\"width\":692,\"height\":748,\"caption\":\"MAN 2 KULON PROGO\"},\"image\":{\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/#\\\/schema\\\/logo\\\/image\\\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/#\\\/schema\\\/person\\\/fe583cc282ca35c3ee3aba623726d784\",\"name\":\"Irawan\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"id\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/3696b0b56d790ca615dbf251a1f96efe804c8478db0d6bfb9fbc7a26ce54d4c6?s=96&d=identicon&r=g\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/3696b0b56d790ca615dbf251a1f96efe804c8478db0d6bfb9fbc7a26ce54d4c6?s=96&d=identicon&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/3696b0b56d790ca615dbf251a1f96efe804c8478db0d6bfb9fbc7a26ce54d4c6?s=96&d=identicon&r=g\",\"caption\":\"Irawan\"},\"sameAs\":[\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\"],\"url\":\"https:\\\/\\\/man2kulonprogo.sch.id\\\/m2kp\\\/author\\\/pi8dx\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Tumpukan (Stack) dan Antrean (Queue) - MAN 2 KULON PROGO","description":"Dalam kehidupan sehari-hari, kita sering menyusun atau mengelola data dengan urutan tertentu. Misalnya, tumpukan piring di dapur atau antrean orang membeli tiket. Kedua situasi ini ternyata memiliki konsep yang sama dengan struktur data di dunia komputer, yaitu Stack (Tumpukan) dan Queue (Antrean).Stack dan Queue adalah struktur data linear, artinya data disusun secara berurutan, tetapi cara mengakses datanya berbeda satu sama lain.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/","og_locale":"id_ID","og_type":"article","og_title":"Tumpukan (Stack) dan Antrean (Queue) - MAN 2 KULON PROGO","og_description":"Dalam kehidupan sehari-hari, kita sering menyusun atau mengelola data dengan urutan tertentu. Misalnya, tumpukan piring di dapur atau antrean orang membeli tiket. Kedua situasi ini ternyata memiliki konsep yang sama dengan struktur data di dunia komputer, yaitu Stack (Tumpukan) dan Queue (Antrean).Stack dan Queue adalah struktur data linear, artinya data disusun secara berurutan, tetapi cara mengakses datanya berbeda satu sama lain.","og_url":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/","og_site_name":"MAN 2 KULON PROGO","article_published_time":"2026-09-26T23:31:35+00:00","og_image":[{"width":1200,"height":630,"url":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-content\/uploads\/2026\/09\/featured-stack-queue.png","type":"image\/png"}],"author":"Irawan","twitter_card":"summary_large_image","twitter_misc":{"Ditulis oleh":"Irawan","Estimasi waktu membaca":"4 menit"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/#article","isPartOf":{"@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/"},"author":{"name":"Irawan","@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/#\/schema\/person\/fe583cc282ca35c3ee3aba623726d784"},"headline":"Tumpukan (Stack) dan Antrean (Queue)","datePublished":"2026-09-26T23:31:35+00:00","mainEntityOfPage":{"@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/"},"wordCount":563,"commentCount":0,"publisher":{"@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/#organization"},"image":{"@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/#primaryimage"},"thumbnailUrl":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-content\/uploads\/2026\/09\/featured-stack-queue.png","keywords":["antrian","queue","stack","tumpukan"],"articleSection":["Informatika Kelas X"],"inLanguage":"id","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/","url":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/","name":"Tumpukan (Stack) dan Antrean (Queue) - MAN 2 KULON PROGO","isPartOf":{"@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/#website"},"primaryImageOfPage":{"@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/#primaryimage"},"image":{"@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/#primaryimage"},"thumbnailUrl":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-content\/uploads\/2026\/09\/featured-stack-queue.png","datePublished":"2026-09-26T23:31:35+00:00","description":"Dalam kehidupan sehari-hari, kita sering menyusun atau mengelola data dengan urutan tertentu. Misalnya, tumpukan piring di dapur atau antrean orang membeli tiket. Kedua situasi ini ternyata memiliki konsep yang sama dengan struktur data di dunia komputer, yaitu Stack (Tumpukan) dan Queue (Antrean).Stack dan Queue adalah struktur data linear, artinya data disusun secara berurutan, tetapi cara mengakses datanya berbeda satu sama lain.","breadcrumb":{"@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/#breadcrumb"},"inLanguage":"id","potentialAction":[{"@type":"ReadAction","target":["https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/"]}]},{"@type":"ImageObject","inLanguage":"id","@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/#primaryimage","url":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-content\/uploads\/2026\/09\/featured-stack-queue.png","contentUrl":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-content\/uploads\/2026\/09\/featured-stack-queue.png","width":1200,"height":630},{"@type":"BreadcrumbList","@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/2026\/09\/27\/tumpukan-stack-dan-antrean-queue\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Beranda","item":"https:\/\/man2kulonprogo.sch.id\/m2kp\/"},{"@type":"ListItem","position":2,"name":"Tumpukan (Stack) dan Antrean (Queue)"}]},{"@type":"WebSite","@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/#website","url":"https:\/\/man2kulonprogo.sch.id\/m2kp\/","name":"MAN 2 KULON PROGO","description":"Terwujudnya Insan yang Berakhlak Mulia, Unggul, Terampil, Inovatif, dan Berwawasan Lingkungan, Bebas dari Korupsi dan Bersih Melayani","publisher":{"@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/man2kulonprogo.sch.id\/m2kp\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"id"},{"@type":"Organization","@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/#organization","name":"MAN 2 KULON PROGO","url":"https:\/\/man2kulonprogo.sch.id\/m2kp\/","logo":{"@type":"ImageObject","inLanguage":"id","@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/#\/schema\/logo\/image\/","url":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-content\/uploads\/2020\/12\/logo.png","contentUrl":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-content\/uploads\/2020\/12\/logo.png","width":692,"height":748,"caption":"MAN 2 KULON PROGO"},"image":{"@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/man2kulonprogo.sch.id\/m2kp\/#\/schema\/person\/fe583cc282ca35c3ee3aba623726d784","name":"Irawan","image":{"@type":"ImageObject","inLanguage":"id","@id":"https:\/\/secure.gravatar.com\/avatar\/3696b0b56d790ca615dbf251a1f96efe804c8478db0d6bfb9fbc7a26ce54d4c6?s=96&d=identicon&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/3696b0b56d790ca615dbf251a1f96efe804c8478db0d6bfb9fbc7a26ce54d4c6?s=96&d=identicon&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/3696b0b56d790ca615dbf251a1f96efe804c8478db0d6bfb9fbc7a26ce54d4c6?s=96&d=identicon&r=g","caption":"Irawan"},"sameAs":["https:\/\/man2kulonprogo.sch.id\/m2kp"],"url":"https:\/\/man2kulonprogo.sch.id\/m2kp\/author\/pi8dx\/"}]}},"_links":{"self":[{"href":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-json\/wp\/v2\/posts\/21055","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-json\/wp\/v2\/comments?post=21055"}],"version-history":[{"count":1,"href":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-json\/wp\/v2\/posts\/21055\/revisions"}],"predecessor-version":[{"id":21057,"href":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-json\/wp\/v2\/posts\/21055\/revisions\/21057"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-json\/wp\/v2\/media\/21056"}],"wp:attachment":[{"href":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-json\/wp\/v2\/media?parent=21055"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-json\/wp\/v2\/categories?post=21055"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/man2kulonprogo.sch.id\/m2kp\/wp-json\/wp\/v2\/tags?post=21055"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}