Wikipedia list of general topics, for CS302 Data Structures, that should be studied:

• Abstract Data Type
• Acyclic Directed Graph
• Algorithm
• All-Pairs Shortest Path
• Amortized Analysis
• Analysis of algorithms
• Array Implementation of Queues
• Average performance
• AVL Tree
• B-Trees
• Backtracking
• Big O notion
• Big Omega notation
• Binary Heap
• Binary Tree
• Binary Search Tree
• Bipartite graph
• Breadth-first search
• Bubble sort
• Bucket Sort
• Canonical order
• Canonicalization
• Circular Linked Lists
• Combinatorics
• Data Structure
• Dense Graph
• Dijkstra's Algorithm
• Directed Acyclic Graph
• Directed Cycles
• Directed Graph
• Directed Path
• Divide and conquer
• Doubly Linked Lists
• Dynamic Programming
• Edge
• Euler Circuits
• Finding Strong Components
• Glossary of graph theory
• Graph
• Graph Theory
• Greedy Algorithms
• Hash Function
• Heap (data structure)
• Heap (mathematics)
• Heapsort
• Heuristic
• Insertion Sort
• Intro to NP Completeness
• In-Order Traversal
• Linked List
• Lexicographical order
• k-d Tree
• List of terms relating to algorithms and data structures
• Little O notation
• Little Omega notation
• Max Heap
• Merge sort
• Min Heap
• Minimum Spanning Tree
• Multiset
• Network Flow
• Partially ordered set
• Patricia Tree
• Permutation
• Pre-Order Traversal
• Polyphase Merge sort
• Post-Order Traversal
• Priority Queues
• Pseudo Code
• Queue
• Quicksort
• Radix Sort
• Radix tree
• Randomized Algorithms
• Randomized Quick sort
• Red Black Graph
• Red-Black Trees
• Self-balancing binary search tree
• Shell sort
• Sorting algorithm
• Space-time tradeoff
• Sparse Graph
• Stack
• Theata Notation
• Topological Sort
• Traveling Salesman Problem
• Treap
• Tree (data structure)
• Tree (graph theory)
• Tree (set theory)
• Tree structure
• Tree traversal
• Trie
• Vertex