• Tópico Tabela Hash reconstruído como apresentação — encadeamento reformulado e endereçamento aberto adicionado, com inserção, busca e exclusão • Mantenha um tópico pressionado na tela inicial para marcá-lo como aprendido

Adicionada a Heap mínima

Adicionados quizzes de fim de tópico para array, lista encadeada, lista duplamente encadeada, fila e pilha — disponíveis a qualquer momento pelo menu

Adicionada a Lista Duplamente Encadeada

Adicionado C++ como terceira linguagem de programação — veja o código de qualquer tópico em Java, Python ou C++.

• Adicionado um sumário "Slides" às apresentações de array, lista encadeada, pilha e fila — toque em qualquer linha para ir direto àquele slide. • Essas apresentações agora lembram o último slide aberto. "Reiniciar" no menu volta ao primeiro slide.

Estrutura de dados Trie adicionada com operações de inserção, remoção e StartsWith (autocompletar).

Ordenação topológica (algoritmo de Kahn) adicionada com integração no construtor de grafos.

Bellman-Ford adicionado ao construtor de grafos

Widget de entrada de valores aprimorado nos algoritmos de ordenação e no construtor de grafos

- Algoritmo de Bellman-Ford adicionado - Diálogo de informações do Dijkstra expandido - Seção de código: link do Replit substituído pelo GitHub

• Clareza aprimorada do conteúdo educacional • Adição de 9 novos idiomas: Português (Brasil), Espanhol (América Latina), Alemão, Francês, Polonês, Ucraniano, Coreano, Japonês e Chinês Simplificado • Um breve logo da Unity agora aparece na inicialização — migramos para a versão gratuita da Unity. Isso nos ajuda a reduzir os custos de desenvolvimento. • Adicionados novo ícone do aplicativo e nome

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.

1. Experience a complete redesign of the pre-order, in-order, post-order, and breadth-first binary tree traversals. Gain a deeper understanding of these traversals as you explore their workings in more detail. 2. Create custom binary trees using the new Binary Tree Constructor. Accessible from the menu, it allows you to experiment with different node values and structures. Please note that the Binary Tree Constructor is currently limited to use within the context of binary tree traversal algorithms.

1. A new feature in the data structures section - Queue - has been introduced! 2. Expanding on the current materials, new content focusing on the double-ended linked list has been added. 3. Slight revisions have been made to the "Check the Code" for Array, Linked List, and Stack. 4. Information about how arrays are stored in memory has been added.