@@ -29,23 +29,23 @@ os dados.
2929
3030` B ` - Iniciante,` A ` - Avançado
3131
32- * ` B ` [ Lista Encadeada (Linked List)] ( src/data-structures/linked-list/README.pt-BR )
33- * ` B ` [ Lista Duplamente Ligada (Doubly Linked List)] ( src/data-structures/doubly-linked-list/README.pt-BR )
34- * ` B ` [ Fila (Queue)] ( src/data-structures/queue/README.pt-BR )
35- * ` B ` [ Stack] ( src/data-structures/stack/README.pt-BR )
36- * ` B ` [ Tabela de Hash (Hash Table)] ( src/data-structures/hash-table/README.pt-BR )
37- * ` B ` [ Heap] ( src/data-structures/heap/README.pt-BR )
38- * ` B ` [ Fila de Prioridade (Priority Queue)] ( src/data-structures/priority-queue/README.pt-BR )
39- * ` A ` [ Trie] ( src/data-structures/trie/README.pt-BR )
40- * ` A ` [ Árvore (Tree)] ( src/data-structures/tree/README.pt-BR )
41- * ` A ` [ Árvore de Pesquisa Binária (Binary Search Tree)] ( src/data-structures/tree/binary-search-tree/README.pt-BR )
42- * ` A ` [ Árvore AVL (AVL Tree)] ( src/data-structures/tree/avl-tree/README.pt-BR )
43- * ` A ` [ Árvore Vermelha-Preta (Red-Black Tree)] ( src/data-structures/tree/red-black-tree/README.pt-BR )
44- * ` A ` [ Árvore de Segmento (Segment Tree)] ( src/data-structures/tree/segment-tree/README.pt-BR ) - com exemplos de consultas min / max / sum range
45- * ` A ` [ Árvore Fenwick (Fenwick Tree)] ( src/data-structures/tree/fenwick-tree/README.pt-BR ) (Árvore indexada binária)
46- * ` A ` [ Gráfico (Graph)] ( src/data-structures/graph/README.pt-BR ) (ambos dirigidos e não direcionados)
47- * ` A ` [ Conjunto Disjuntor (Disjoint Set)] ( src/data-structures/disjoint-set/README.pt-BR )
48- * ` A ` [ Filtro Bloom (Bloom Filter)] ( src/data-structures/bloom-filter/README.pt-BR )
32+ * ` B ` [ Lista Encadeada (Linked List)] ( src/data-structures/linked-list/README.pt-BR.md )
33+ * ` B ` [ Lista Duplamente Ligada (Doubly Linked List)] ( src/data-structures/doubly-linked-list/README.pt-BR.md )
34+ * ` B ` [ Fila (Queue)] ( src/data-structures/queue/README.pt-BR.md )
35+ * ` B ` [ Stack] ( src/data-structures/stack/README.pt-BR.md )
36+ * ` B ` [ Tabela de Hash (Hash Table)] ( src/data-structures/hash-table/README.pt-BR.md )
37+ * ` B ` [ Heap] ( src/data-structures/heap/README.pt-BR.md )
38+ * ` B ` [ Fila de Prioridade (Priority Queue)] ( src/data-structures/priority-queue/README.pt-BR.md )
39+ * ` A ` [ Trie] ( src/data-structures/trie/README.pt-BR.md )
40+ * ` A ` [ Árvore (Tree)] ( src/data-structures/tree/README.pt-BR.md )
41+ * ` A ` [ Árvore de Pesquisa Binária (Binary Search Tree)] ( src/data-structures/tree/binary-search-tree/README.pt-BR.md )
42+ * ` A ` [ Árvore AVL (AVL Tree)] ( src/data-structures/tree/avl-tree/README.pt-BR.md )
43+ * ` A ` [ Árvore Vermelha-Preta (Red-Black Tree)] ( src/data-structures/tree/red-black-tree/README.pt-BR.md )
44+ * ` A ` [ Árvore de Segmento (Segment Tree)] ( src/data-structures/tree/segment-tree/README.pt-BR.md ) - com exemplos de consultas min / max / sum range
45+ * ` A ` [ Árvore Fenwick (Fenwick Tree)] ( src/data-structures/tree/fenwick-tree/README.pt-BR.md ) (Árvore indexada binária)
46+ * ` A ` [ Gráfico (Graph)] ( src/data-structures/graph/README.pt-BR.md ) (ambos dirigidos e não direcionados)
47+ * ` A ` [ Conjunto Disjuntor (Disjoint Set)] ( src/data-structures/disjoint-set/README.pt-BR.md )
48+ * ` A ` [ Filtro Bloom (Bloom Filter)] ( src/data-structures/bloom-filter/README.pt-BR.md )
4949
5050##Algoritmos
5151