Data Science ์๋ฃ๊ตฌ์กฐ&์๊ณ ๋ฆฌ์ฆ
Graph
Union-find ์๋ฃ๊ตฌ์กฐ
์ด์งํธ๋ฆฌ ์ํ(traversal)
๊ท ํ์ด์งํ์ํธ๋ฆฌ(Balanced BST)
ํธ๋ฆฌ(Tree)
ํด์ ํ ์ด๋ธ(Hash Table)
์๋ฐฉํฅ ์ฐ๊ฒฐ๋ฆฌ์คํธ(DoublyLinkedList)
์ฐ๊ฒฐ๋ฆฌ์คํธ(linked list)
๋ฐฐ์ด vs ๋ฆฌ์คํธ
์๋ฃ๊ตฌ์กฐ & ์๊ณ ๋ฆฌ์ฆ ๊ฐ๋
์ํ์๊ฐ