don't stop believing

Stack과 대비되는 Queue 입니다. Queue에서는 FIFO(First-In, First-Out)의 개념을 가지고 있습니다. https://en.wikipedia.org/wiki/Queue_(abstract_data_type) Queue (abstract data type) - Wikipedia Representation of a FIFO (first in, first out) queue In computer science, a queue is a collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition..

자료구조 중 스택입니다. Stack과 Queue는 항상 같이 설명됩니다. https://en.wikipedia.org/wiki/Stack_(abstract_data_type) Stack (abstract data type) - Wikipedia From Wikipedia, the free encyclopedia Jump to navigation Jump to search Simple representation of a stack runtime with push and pop operations. In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal en.w..

이진 탐색 트리입니다. https://en.wikipedia.org/wiki/Binary_search_tree Binary search tree - Wikipedia A binary search tree of size 9 and depth 3, with 8 at the root. The leaves are not drawn. In computer science, binary search trees (BST), sometimes called ordered or sorted binary trees, are a particular type of container: data structures that store "items en.wikipedia.org 이진 탐색 트리는 아래아 같은 조건을 가지고 있습니다. ..