> For the complete documentation index, see [llms.txt](https://algorithm.prettylog.com/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://algorithm.prettylog.com/overview/2.-data-structures.md).

# 2. Data Structures

- [Array](https://algorithm.prettylog.com/overview/2.-data-structures/array.md)
- [Stack](https://algorithm.prettylog.com/overview/2.-data-structures/stack.md)
- [Queue](https://algorithm.prettylog.com/overview/2.-data-structures/queue.md)
- [Tree](https://algorithm.prettylog.com/overview/2.-data-structures/tree.md)
- [PreOrder, InOrder, PostOrder](https://algorithm.prettylog.com/overview/2.-data-structures/tree/preorder-inorder-postorder.md)
- [Transfer between each](https://algorithm.prettylog.com/overview/2.-data-structures/tree/preorder-inorder-postorder/transfer-between-each.md)
- [Traverse](https://algorithm.prettylog.com/overview/2.-data-structures/tree/preorder-inorder-postorder/traverse.md)
- [Binary Tree](https://algorithm.prettylog.com/overview/2.-data-structures/tree/binary-tree.md)
- [Binary Search Tree](https://algorithm.prettylog.com/overview/2.-data-structures/tree/binary-tree/binary-search-tree.md)
- [Graph](https://algorithm.prettylog.com/overview/2.-data-structures/graph.md)
- [Data Structure](https://algorithm.prettylog.com/overview/2.-data-structures/graph/data-structure.md): How to store Graph data in a code?
- [Traverse Graph](https://algorithm.prettylog.com/overview/2.-data-structures/graph/traverse-graph.md)
- [Detect a cycle in a Graph](https://algorithm.prettylog.com/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph.md)
- [DFS \*](https://algorithm.prettylog.com/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph/dfs.md)
- [undirected clean code](https://algorithm.prettylog.com/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph/dfs/undirected-clean-code.md)
- [Union Find](https://algorithm.prettylog.com/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph/union-find.md)
- [Count edges - undirected only](https://algorithm.prettylog.com/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](https://algorithm.prettylog.com/overview/2.-data-structures/linked-list.md)
- [Trie](https://algorithm.prettylog.com/overview/2.-data-structures/trie.md)
- [Javascript](https://algorithm.prettylog.com/overview/2.-data-structures/trie/javascript.md)
- [Java](https://algorithm.prettylog.com/overview/2.-data-structures/trie/java.md)
- [Union Find](https://algorithm.prettylog.com/overview/2.-data-structures/union-find.md): Disjoint-set: not sharing any element between two sets
- [Detect Cycle with Disjoint-set Union Find](https://algorithm.prettylog.com/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](https://algorithm.prettylog.com/overview/2.-data-structures/union-find/kruskal-algorithm.md)
- [Heap](https://algorithm.prettylog.com/overview/2.-data-structures/heap.md)
- [Matrix](https://algorithm.prettylog.com/overview/2.-data-structures/matrix.md)
- [Union Find: Disjoint Set](https://algorithm.prettylog.com/overview/2.-data-structures/union-find-disjoint-set.md): Tree, MST (Kruskal)