์Šค์œ„ํ”„ํŠธ๋กœ ๊ตฌํ˜„ํ•˜๋Š” ์ž๋ฃŒ๊ตฌ์กฐ 8: ์ด์ง„ ํƒ์ƒ‰ ํŠธ๋ฆฌ(Binary Search Tree)
์Šค์œ„ํ”„ํŠธ๋กœ ๊ตฌํ˜„ํ•˜๋Š” ์ž๋ฃŒ๊ตฌ์กฐ 7: ํŠธ๋ฆฌ์™€ ์ด์ง„ ํŠธ๋ฆฌ(Binary Tree)
์Šค์œ„ํ”„ํŠธ๋กœ ๊ตฌํ˜„ํ•˜๋Š” ์ž๋ฃŒ๊ตฌ์กฐ 6: ์šฐ์„ ์ˆœ์œ„ ํ(Priority Queue)
์Šค์œ„ํ”„ํŠธ๋กœ ๊ตฌํ˜„ํ•˜๋Š” ์ž๋ฃŒ๊ตฌ์กฐ 5: ํž™(Heap)
์Šค์œ„ํ”„ํŠธ๋กœ ๊ตฌํ˜„ํ•˜๋Š” ์ž๋ฃŒ๊ตฌ์กฐ 4: ๋”๋ธ” ๋งํฌ๋“œ ๋ฆฌ์ŠคํŠธ(Doubly Linked List)
์Šค์œ„ํ”„ํŠธ๋กœ ๊ตฌํ˜„ํ•˜๋Š” ์ž๋ฃŒ๊ตฌ์กฐ 3: ํ(Queue)
์Šค์œ„ํ”„ํŠธ๋กœ ๊ตฌํ˜„ํ•˜๋Š” ์ž๋ฃŒ๊ตฌ์กฐ 2: ๋งํฌ๋“œ ๋ฆฌ์ŠคํŠธ(Linked List)
์Šค์œ„ํ”„ํŠธ๋กœ ๊ตฌํ˜„ํ•˜๋Š” ์ž๋ฃŒ๊ตฌ์กฐ 1: ์Šคํƒ(Stack)

ํ‹ฐ์Šคํ† ๋ฆฌํˆด๋ฐ”