Wonjun Jeong

Backend engineer specializing in scalable systems and reliable API design.

Data Structure

[Data Structure] CS ์Šคํ„ฐ๋”” 14์ฃผ์ฐจ</a> </h2>

Published:
Updated:

linked-list, tree, binary-tree, binary-search-tree, ternary-search-tree

</article> </div>

[Data Structure] CS ์Šคํ„ฐ๋”” 1์ฃผ์ฐจ</a> </h2>

Published:
Updated:

์‹œ๊ฐ„๋ณต์žก๋„, ๊ณต๊ฐ„๋ณต์žก๋„, ๋งํฌ๋“œ ๋ฆฌ์ŠคํŠธ, ์Šคํƒ, ํ, ํ•ด์‹œ, ํŠธ๋ฆฌ, ํž™, ์ •๋ ฌ

</article> </div>

[Data Structure] Sort (์ •๋ ฌ)</a> </h2>

Published:
Updated:

์ •๋ ฌ ์ •๋ฆฌ

</article> </div>

[Data Structure] Red Black Tree (๋ ˆ๋“œ ๋ธ”๋ž™ ํŠธ๋ฆฌ)</a> </h2>

Published:
Updated:

๋ ˆ๋“œ ๋ธ”๋ž™ ํŠธ๋ฆฌ ์ •๋ฆฌ

</article> </div>

[Data Structure] Heap & Tree (ํž™ & ํŠธ๋ฆฌ)</a> </h2>

Published:
Updated:

ํž™๊ณผ ํŠธ๋ฆฌ ์ •๋ฆฌ

</article> </div>

[Data Structure] Hash (ํ•ด์‹œ)</a> </h2>

Published:
Updated:

Hash ์ •๋ฆฌ

</article> </div>

[Data Structure] AVL Tree (AVL ํŠธ๋ฆฌ)</a> </h2>

Published:
Updated:

AVL ํŠธ๋ฆฌ ์ •๋ฆฌ

</article> </div>

[Data Structure] Stack and Queue (์Šคํƒ๊ณผ ํ)</a> </h2>

Published:
Updated:

์Šคํƒ๊ณผ ํ ์ •๋ฆฌ

</article> </div>

[Data Structure] Linked List (์—ฐ๊ฒฐ ๋ฆฌ์ŠคํŠธ)</a> </h2>

Published:
Updated:

Linked List ์ •๋ฆฌ

</article> </div>

[Data Structure] Time Complexity (์‹œ๊ฐ„ ๋ณต์žก๋„)</a> </h2>

Published:
Updated:

์‹œ๊ฐ„ ๋ณต์žก๋„ ์ •๋ฆฌ

</article> </div>

[Data Structure] Object-Oriented Programming (๊ฐ์ฒด์ง€ํ–ฅ ํ”„๋กœ๊ทธ๋ž˜๋ฐ)</a> </h2>

Published:
Updated:

๊ฐ์ฒด์ง€ํ–ฅ ์ •๋ฆฌ

</article> </div>

[Data Structure] Generic ํ”„๋กœ๊ทธ๋ž˜๋ฐ</a> </h2>

Published:
Updated:

๊ฐ์ฒด์ง€ํ–ฅ ์ •๋ฆฌ

</article> </div>

[Data Structure] CS ์Šคํ„ฐ๋”” 1์ฃผ์ฐจ

Published:
Updated:

์‹œ๊ฐ„๋ณต์žก๋„, ๊ณต๊ฐ„๋ณต์žก๋„, ๋งํฌ๋“œ ๋ฆฌ์ŠคํŠธ, ์Šคํƒ, ํ, ํ•ด์‹œ, ํŠธ๋ฆฌ, ํž™, ์ •๋ ฌ