{"schema_version":"0.1","resource":{"uid":"gh/sukhdev01/Queue-Data-Structure","repory_url":"https://takemyrepo.com/gh/sukhdev01/Queue-Data-Structure","source":"github","kind":"repo","source_id":"247508283","source_url":"https://github.com/sukhdev01/Queue-Data-Structure","name":"Queue-Data-Structure","full_name":"sukhdev01/Queue-Data-Structure","owner":{"login":"sukhdev01","source_id":"49002521","url":"https://github.com/sukhdev01","type":"user","avatar_url":"https://avatars.githubusercontent.com/u/49002521?v=4","on_repory":false},"description":"Some codes for Queue operations such as Queue with Array, Circular Queue with Array, Queue with Linked List, Circular Queue with Linked List, Circular Queue Linked List Splitting. These are having operations such as enqueue, dequeue, traverse, insertion, deletion, traverse, isEmpty, isFull, searching etc.            ( in C++)","homepage":null,"topics":["circular-queue","circular-queue-array","circular-queue-linkedlidt","cpp","dequeue","isempty","isfull","queue-array","queue-data-stucture","queue-linked-list","splitting","traverse"],"language":"C++","license":null,"license_note":"none declared; public does not mean open source","popularity":{"stars_or_likes":1,"forks":1,"downloads_30d":null},"task":null,"library":null,"gated":false,"archived":false,"image_url":null,"details":[{"k":"Open issues","v":"0","how":"Issues and pull requests open on GitHub"},{"k":"Watchers","v":"1","how":"People notified of every change on GitHub"},{"k":"Started","v":"2020-03","how":"Repository created on GitHub"},{"k":"Repository size","v":"10 KB","how":"Code and history, as counted by GitHub"},{"k":"Main branch","v":"master","how":"Where an agent clones from"},{"k":"On GitHub","v":"wiki, issues","how":"Switched on by the maintainer"}],"created_at":"2020-03-15T16:45:05+00:00","updated_at":"2020-10-01T10:10:39+00:00","synced_at":"2026-11-21T06:20:33.843299+00:00","from_snapshot":false},"install_plan_url":"https://takemyrepo.com/api/v1/install-plan?uid=gh%2Fsukhdev01%2FQueue-Data-Structure"}