資料結構是資訊系統開發的主軸, 也是資訊系學生必備的技能之一.
本課程主要分成三大部分, 包含基本資料結構，例如Array, Linked-list, Stack, Queue等介紹,
接續介紹進階資料結構, 包括Priority Queue, Tree, Search Tree, Iterator等,
最後介紹各種典型演算法如何結合資料結構, 有效率的進行資料處理,
並透過大量的動手實作的作業與範例, 期望學生能習得設計資料結構或利用各種資料結構
開發軟體系統的能力.

Data structure is the main axis for information system development and is also one of the essential skills for information students.
This course is mainly divided into three parts, including basic data structures, such as Array, Linked-list, Stack, Queue and other introductions,
Continue to introduce advanced data structures, including Priority Queue, Tree, Search Tree, Iterator, etc.
Finally, we introduce how various typical algorithms combine data structures and efficiently process data.
And through a large number of manual operational operations and examples, students are expected to be able to design data structures or use various data structures.
Ability to develop software systems.

本課程在於學習各種不同的資料表現形式，使散亂的資料能夠以規則方式呈現並進行有效率的運算處理。在本課程內容安排上，將介紹常用的資料結構與相關演算法，包含堆疊(stack)、佇列(queue)、樹(tree)、圖(graph)、排序(sorting)等，可廣泛地運用在不同領域上。

This course learns various different data presentations, so that scattered data can be presented in a regular manner and efficient computing processing. In terms of content arrangement of this course, commonly used data structures and related algorithms will be introduced, including stack, queue, tree, graph, sorting, etc., which can be widely used in different fields.

Data Structure and Algorithms in Java

Data Structure and Algorithms in Java