Added B-Tree — add and remove keys, choose the maximum degree, and watch the nodes split, borrow and merge

• Added end-of-topic quizzes to every remaining topic — sorting algorithms, trees, traversals, and graph algorithms • Heap: build-heap now runs step by step from the info dialog, showing every comparison and swap

• Rebuilt the Hash Table topic as a slide-show presentation — reworked separate chaining and added open addressing, with insert, search, and delete • Long-press a topic on the home screen to mark it as learned

Added Min-Heap

Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu

Added Doubly Linked List

Added C++ as a third programming language — view any topic's code in Java, Python, or C++.

• Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide. • These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide.

Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations.

Added Topological Sort (Kahn's algorithm) with graph constructor integration.

Added Bellman-Ford to graph constructor

Improved value input widget across Sorting Algorithms and Graph Constructor

- Added Bellman-Ford algorithm - Expanded Dijkstra info dialog - Code section: Replit replaced with GitHub link

• Improved clarity of educational content • Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese • A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs. • New app icon & name

1. Union-Find Data Structure: Now available to enhance understanding of network connectivity and related challenges. 2. Kruskal’s Algorithm: Newly added to provide a robust method for computing the Minimum Spanning Tree (MST) in weighted graphs. 3. Enhanced Algorithm Code: Refined code for DFS, BFS, Prim’s MST, and Dijkstra ensures more effective learning experiences. 4. New Look: Our app icon and name have been updated to better reflect our evolving brand and mission.

The "Random" menu item has been replaced with "Examples" for both the Minimum Spanning Tree and Dijkstra's algorithm presentations. Similar to the updates made previously for DFS and BFS, each of these sections now includes four predefined examples. This change fosters a more structured and illustrative learning experience, allowing for a clear demonstration of these algorithms on specific, consistent examples.

1. Enhanced visual presentations for Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, including both Lomuto and Hoare partition schemes. Minor refinements have also been made to Merge Sort and Heap Sort to enhance learning engagement. 2. The code for all sorting algorithms has been improved for better readability.

The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience.

Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure. Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding.

Small UI Bug Fix

1. Enhanced Information Dialogues: The info dialogues for Array, Linked List, Stack, and Queue have been updated with additional information. 2. Slide Navigation Indicator: For a better learning experience during slide-like presentations on Array, Linked List, Stack, and Queue, we've added a slide navigation indicator. This new feature displays the current slide number and the total number of slides, making it easier to track your progress through the material.

We've updated the Home screen with a new look and feel to enhance your experience right from the start.

1. Self-Balancing Trees Practice: Practice inserting and deleting nodes in AVL and Red-Black trees. 2. Redesigned Inserting and Deleting in Binary Search Trees: The topics on inserting and deleting in regular binary search trees have been completely redesigned for an improved learning experience.

Fixed an issue affecting some users where the app might not unlock after purchase.

You can now select a theme for the code, tailoring the appearance to your individual preference.