# 2. Data Structures

- [Array](/overview/2.-data-structures/array.md)
- [Stack](/overview/2.-data-structures/stack.md)
- [Queue](/overview/2.-data-structures/queue.md)
- [Tree](/overview/2.-data-structures/tree.md)
- [PreOrder, InOrder, PostOrder](/overview/2.-data-structures/tree/preorder-inorder-postorder.md)
- [Transfer between each](/overview/2.-data-structures/tree/preorder-inorder-postorder/transfer-between-each.md)
- [Traverse](/overview/2.-data-structures/tree/preorder-inorder-postorder/traverse.md)
- [Binary Tree](/overview/2.-data-structures/tree/binary-tree.md)
- [Binary Search Tree](/overview/2.-data-structures/tree/binary-tree/binary-search-tree.md)
- [Graph](/overview/2.-data-structures/graph.md)
- [Data Structure](/overview/2.-data-structures/graph/data-structure.md): How to store Graph data in a code?
- [Traverse Graph](/overview/2.-data-structures/graph/traverse-graph.md)
- [Detect a cycle in a Graph](/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph.md)
- [DFS \*](/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph/dfs.md)
- [undirected clean code](/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph/dfs/undirected-clean-code.md)
- [Union Find](/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph/union-find.md)
- [Count edges - undirected only](/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph/count-edges-undirected-only.md): Edges should have to be n - 1 where n is the number of vertexes
- [Linked List](/overview/2.-data-structures/linked-list.md)
- [Trie](/overview/2.-data-structures/trie.md)
- [Javascript](/overview/2.-data-structures/trie/javascript.md)
- [Java](/overview/2.-data-structures/trie/java.md)
- [Union Find](/overview/2.-data-structures/union-find.md): Disjoint-set: not sharing any element between two sets
- [Detect Cycle with Disjoint-set Union Find](/overview/2.-data-structures/union-find/detect-cycle-with-disjoint-set-union-find.md): use Union Find data structure to find a cycle
- [Kruskal Algorithm](/overview/2.-data-structures/union-find/kruskal-algorithm.md)
- [Heap](/overview/2.-data-structures/heap.md)
- [Matrix](/overview/2.-data-structures/matrix.md)
- [Union Find: Disjoint Set](/overview/2.-data-structures/union-find-disjoint-set.md): Tree, MST (Kruskal)