From e954d6d0f3916722b77dd7c092095830a904c616 Mon Sep 17 00:00:00 2001 From: Oleksii Trekhleb Date: Tue, 16 Apr 2019 18:05:39 +0300 Subject: [PATCH] pt-BR translations fixes. --- README.pt-BR.md | 34 +++++++++---------- src/data-structures/bloom-filter/README.md | 3 +- .../bloom-filter/README.pt-BR.md | 3 -- src/data-structures/disjoint-set/README.md | 3 +- .../disjoint-set/README.pt-BR.md | 4 --- .../doubly-linked-list/README.md | 5 ++- .../doubly-linked-list/README.pt-BR.md | 3 -- src/data-structures/graph/README.md | 4 ++- src/data-structures/graph/README.pt-BR.md | 3 -- src/data-structures/hash-table/README.md | 5 ++- .../hash-table/README.pt-BR.md | 3 -- src/data-structures/heap/README.md | 5 ++- src/data-structures/heap/README.pt-BR.md | 3 -- src/data-structures/linked-list/README.md | 5 ++- .../linked-list/README.pt-BR.md | 9 ----- src/data-structures/priority-queue/README.md | 5 ++- .../priority-queue/README.pt-BR.md | 3 -- src/data-structures/queue/README.md | 5 ++- src/data-structures/queue/README.pt-BR.md | 3 -- src/data-structures/stack/README.md | 5 ++- src/data-structures/stack/README.pt-BR.md | 3 -- src/data-structures/tree/README.md | 3 +- src/data-structures/tree/README.pt-BR.md | 3 -- .../tree/avl-tree/README.pt-BR.md | 3 -- .../tree/binary-search-tree/README.pt-BR.md | 3 -- .../tree/fenwick-tree/README.md | 4 +-- .../tree/fenwick-tree/README.pt-BR.md | 3 -- .../tree/red-black-tree/README.md | 4 +-- .../tree/red-black-tree/README.pt-BR.md | 3 -- .../tree/segment-tree/README.md | 4 +-- .../tree/segment-tree/README.pt-BR.md | 3 -- src/data-structures/trie/README.md | 4 ++- src/data-structures/trie/README.pt-BR.md | 3 -- 33 files changed, 63 insertions(+), 93 deletions(-) diff --git a/README.pt-BR.md b/README.pt-BR.md index 6e3f3354..8f8de717 100644 --- a/README.pt-BR.md +++ b/README.pt-BR.md @@ -29,23 +29,23 @@ os dados. `B` - Iniciante, `A` - Avançado -* `B` [Lista Encadeada (Linked List)](src/data-structures/linked-list.pt-BR) -* `B` [Lista Duplamente Ligada (Doubly Linked List)](src/data-structures/doubly-linked-list.pt-BR) -* `B` [Fila (Queue)](src/data-structures/queue.pt-BR) -* `B` [Stack](src/data-structures/stack.pt-BR) -* `B` [Tabela de Hash (Hash Table)](src/data-structures/hash-table.pt-BR) -* `B` [Heap](src/data-structures/heap.pt-BR) -* `B` [Fila de Prioridade (Priority Queue)](src/data-structures/priority-queue.pt-BR) -* `A` [Trie](src/data-structures/trie.pt-BR) -* `A` [Árvore (Tree)](src/data-structures/tree.pt-BR) - * `A` [Árvore de Pesquisa Binária (Binary Search Tree)](src/data-structures/tree/binary-search-tree.pt-BR) - * `A` [Árvore AVL (AVL Tree)](src/data-structures/tree/avl-tree.pt-BR) - * `A` [Árvore Vermelha-Preta (Red-Black Tree)](src/data-structures/tree/red-black-tree.pt-BR) - * `A` [Árvore de Segmento (Segment Tree)](src/data-structures/tree/segment-tree.pt-BR) - com exemplos de consultas min / max / sum range - * `A` [Árvore Fenwick (Fenwick Tree)](src/data-structures/tree/fenwick-tree.pt-BR) (Árvore indexada binária) -* `A` [Gráfico (Graph)](src/data-structures/graph.pt-BR) (ambos dirigidos e não direcionados) -* `A` [Conjunto Disjuntor (Disjoint Set)](src/data-structures/disjoint-set.pt-BR) -* `A` [Filtro Bloom (Bloom Filter)](src/data-structures/bloom-filter.pt-BR) +* `B` [Lista Encadeada (Linked List)](src/data-structures/linked-list/README.pt-BR) +* `B` [Lista Duplamente Ligada (Doubly Linked List)](src/data-structures/doubly-linked-list/README.pt-BR) +* `B` [Fila (Queue)](src/data-structures/queue/README.pt-BR) +* `B` [Stack](src/data-structures/stack/README.pt-BR) +* `B` [Tabela de Hash (Hash Table)](src/data-structures/hash-table/README.pt-BR) +* `B` [Heap](src/data-structures/heap/README.pt-BR) +* `B` [Fila de Prioridade (Priority Queue)](src/data-structures/priority-queue/README.pt-BR) +* `A` [Trie](src/data-structures/trie/README.pt-BR) +* `A` [Árvore (Tree)](src/data-structures/tree/README.pt-BR) + * `A` [Árvore de Pesquisa Binária (Binary Search Tree)](src/data-structures/tree/binary-search-tree/README.pt-BR) + * `A` [Árvore AVL (AVL Tree)](src/data-structures/tree/avl-tree/README.pt-BR) + * `A` [Árvore Vermelha-Preta (Red-Black Tree)](src/data-structures/tree/red-black-tree/README.pt-BR) + * `A` [Árvore de Segmento (Segment Tree)](src/data-structures/tree/segment-tree/README.pt-BR) - com exemplos de consultas min / max / sum range + * `A` [Árvore Fenwick (Fenwick Tree)](src/data-structures/tree/fenwick-tree/README.pt-BR) (Árvore indexada binária) +* `A` [Gráfico (Graph)](src/data-structures/graph/README.pt-BR) (ambos dirigidos e não direcionados) +* `A` [Conjunto Disjuntor (Disjoint Set)](src/data-structures/disjoint-set/README.pt-BR) +* `A` [Filtro Bloom (Bloom Filter)](src/data-structures/bloom-filter/README.pt-BR) ## Algoritmos diff --git a/src/data-structures/bloom-filter/README.md b/src/data-structures/bloom-filter/README.md index 14c8dbda..17c66677 100644 --- a/src/data-structures/bloom-filter/README.md +++ b/src/data-structures/bloom-filter/README.md @@ -1,7 +1,8 @@ # Bloom Filter _Read this in other languages:_ -[_Русский_](README.ru-RU.md) | [_Português_](README.pt-BR.md) +[_Русский_](README.ru-RU.md), +[_Português_](README.pt-BR.md) A **bloom filter** is a space-efficient probabilistic data structure designed to test whether an element diff --git a/src/data-structures/bloom-filter/README.pt-BR.md b/src/data-structures/bloom-filter/README.pt-BR.md index c20ea537..77c42322 100644 --- a/src/data-structures/bloom-filter/README.pt-BR.md +++ b/src/data-structures/bloom-filter/README.pt-BR.md @@ -1,8 +1,5 @@ # Filtro Bloom (Bloom Filter) -_Leia em outro idioma:_ -[_English_](README.md) | [_Русский_](README.ru-RU.md) - O **bloom filter** é uma estrutura de dados probabilística espaço-eficiente designada para testar se um elemento está ou não presente em um conjunto de dados. Foi projetado para ser diff --git a/src/data-structures/disjoint-set/README.md b/src/data-structures/disjoint-set/README.md index 70045aef..535960c7 100644 --- a/src/data-structures/disjoint-set/README.md +++ b/src/data-structures/disjoint-set/README.md @@ -1,7 +1,8 @@ # Disjoint Set _Read this in other languages:_ -[_Русский_](README.ru-RU.md) | [_Português_](README.pt-BR.md) +[_Русский_](README.ru-RU.md), +[_Português_](README.pt-BR.md) **Disjoint-set** data structure (also called a union–find data structure or merge–find set) is a data diff --git a/src/data-structures/disjoint-set/README.pt-BR.md b/src/data-structures/disjoint-set/README.pt-BR.md index b8750942..130b8aea 100644 --- a/src/data-structures/disjoint-set/README.pt-BR.md +++ b/src/data-structures/disjoint-set/README.pt-BR.md @@ -1,8 +1,5 @@ # Conjunto Disjuntor (Disjoint Set) -_Leia em outro idioma:_ -[_English_](README.md) | [_Русский_](README.ru-RU.md) - **Conjunto Disjuntor** **Conjunto Disjuntor** é uma estrutura de dados (também chamado de @@ -17,7 +14,6 @@ Além de muitos outros usos (veja a seção Applications), conjunto disjuntor desempenham um papel fundamental no algoritmo de Kruskal para encontrar a árvore geradora mínima de um gráfico (graph). - ![disjoint set](https://upload.wikimedia.org/wikipedia/commons/6/67/Dsu_disjoint_sets_init.svg) *MakeSet* cria 8 singletons. diff --git a/src/data-structures/doubly-linked-list/README.md b/src/data-structures/doubly-linked-list/README.md index 9f87cca7..48a5e885 100644 --- a/src/data-structures/doubly-linked-list/README.md +++ b/src/data-structures/doubly-linked-list/README.md @@ -1,7 +1,10 @@ # Doubly Linked List _Read this in other languages:_ -[_Русский_](README.ru-RU.md) | [_简体中文_](README.zh-CN.md) | [_日本語_](README.ja-JP.md) | [_Português_](README.pt-BR.md) +[_Русский_](README.ru-RU.md), +[_简体中文_](README.zh-CN.md), +[_日本語_](README.ja-JP.md), +[_Português_](README.pt-BR.md) In computer science, a **doubly linked list** is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains diff --git a/src/data-structures/doubly-linked-list/README.pt-BR.md b/src/data-structures/doubly-linked-list/README.pt-BR.md index 1523d0dc..73c86f53 100644 --- a/src/data-structures/doubly-linked-list/README.pt-BR.md +++ b/src/data-structures/doubly-linked-list/README.pt-BR.md @@ -1,8 +1,5 @@ # Lista Duplamente Ligada (Doubly Linked List) -_Leia em outro idioma:_ -[_English_](README.md) | [_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) - Na ciência da computação, uma **lista duplamente conectada** é uma estrutura de dados vinculada que se consistem em um conjunto de registros sequencialmente vinculados chamados de nós (nodes). Em cada nó contém dois diff --git a/src/data-structures/graph/README.md b/src/data-structures/graph/README.md index c1458436..98acf436 100644 --- a/src/data-structures/graph/README.md +++ b/src/data-structures/graph/README.md @@ -1,7 +1,9 @@ # Graph _Read this in other languages:_ -[_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) | [_Português_](README.pt-BR.md) +[_简体中文_](README.zh-CN.md), +[_Русский_](README.ru-RU.md), +[_Português_](README.pt-BR.md) In computer science, a **graph** is an abstract data type that is meant to implement the undirected graph and diff --git a/src/data-structures/graph/README.pt-BR.md b/src/data-structures/graph/README.pt-BR.md index 138173d1..c8305b88 100644 --- a/src/data-structures/graph/README.pt-BR.md +++ b/src/data-structures/graph/README.pt-BR.md @@ -1,8 +1,5 @@ # Gráfico (Graph) -_Read this in other languages:_ -[_English_](README.md) | [_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) - Na ciência da computação, um **gráfico** é uma abstração de estrutura de dados que se destina a implementar os conceitos da matemática de gráficos direcionados e não direcionados, especificamente o campo da diff --git a/src/data-structures/hash-table/README.md b/src/data-structures/hash-table/README.md index f2a36415..d5258fea 100644 --- a/src/data-structures/hash-table/README.md +++ b/src/data-structures/hash-table/README.md @@ -1,7 +1,10 @@ # Hash Table _Read this in other languages:_ -[_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) | [_日本語_](README.ja-JP.md) | [_Português_](README.pt-BR.md) +[_简体中文_](README.zh-CN.md), +[_Русский_](README.ru-RU.md), +[_日本語_](README.ja-JP.md), +[_Português_](README.pt-BR.md) In computing, a **hash table** (hash map) is a data structure which implements an *associative array* diff --git a/src/data-structures/hash-table/README.pt-BR.md b/src/data-structures/hash-table/README.pt-BR.md index 9f8e9153..0adf9ca9 100644 --- a/src/data-structures/hash-table/README.pt-BR.md +++ b/src/data-structures/hash-table/README.pt-BR.md @@ -1,8 +1,5 @@ # Tabela de Hash (Hash Table) -_Leia em outro idioma:_ -[_English_](README.md) | [_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) - Na ciência da computação, uma **tabela de hash** (hash map) é uma estrutura de dados pela qual implementa um tipo de dado abstrado de *array associativo*, uma estrutura que pode *mapear chaves para valores*. diff --git a/src/data-structures/heap/README.md b/src/data-structures/heap/README.md index 5f242da1..f0334f26 100644 --- a/src/data-structures/heap/README.md +++ b/src/data-structures/heap/README.md @@ -1,7 +1,10 @@ # Heap (data-structure) _Read this in other languages:_ -[_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) | [_日本語_](README.ja-JP.md) | [_Português_](README.pt-BR.md) +[_简体中文_](README.zh-CN.md), +[_Русский_](README.ru-RU.md), +[_日本語_](README.ja-JP.md), +[_Português_](README.pt-BR.md) In computer science, a **heap** is a specialized tree-based data structure that satisfies the heap property described diff --git a/src/data-structures/heap/README.pt-BR.md b/src/data-structures/heap/README.pt-BR.md index 9b86e4e5..e78f6c19 100644 --- a/src/data-structures/heap/README.pt-BR.md +++ b/src/data-structures/heap/README.pt-BR.md @@ -1,8 +1,5 @@ # Heap (estrutura de dados) -_Leia em outro idioma:_ -[_English_](README.md) | [_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) - Na ciência da computação, um **heap** é uma estrutura de dados baseada em uma árvore especializada que satisfaz a propriedade _heap_ descrita abaixo. diff --git a/src/data-structures/linked-list/README.md b/src/data-structures/linked-list/README.md index 2e038ac2..3fd10e24 100644 --- a/src/data-structures/linked-list/README.md +++ b/src/data-structures/linked-list/README.md @@ -1,7 +1,10 @@ # Linked List _Read this in other languages:_ -[_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) | [_日本語_](README.ja-JP.md) | [_Português_](README.pt-BR.md) +[_简体中文_](README.zh-CN.md), +[_Русский_](README.ru-RU.md), +[_日本語_](README.ja-JP.md), +[_Português_](README.pt-BR.md) In computer science, a **linked list** is a linear collection of data elements, in which linear order is not given by diff --git a/src/data-structures/linked-list/README.pt-BR.md b/src/data-structures/linked-list/README.pt-BR.md index 50b2c957..03fec359 100644 --- a/src/data-structures/linked-list/README.pt-BR.md +++ b/src/data-structures/linked-list/README.pt-BR.md @@ -1,8 +1,5 @@ # Lista Encadeada (Linked List) -_Leia em outro idioma:_ -[_English_](README.md) | [_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) - Na ciência da computação, uma **lista encadeada** é uma coleção linear de elementos de dado, em que a ordem linear não é dada por sua locação física na memória. Em vez disso, cada elemento aponta para o próximo. @@ -146,15 +143,9 @@ end ReverseTraversal ### Complexidade de Tempo -<<<<<<< HEAD -| Acesso | Busca | Inserção | Deleção | -| :----: | :---: | :------: | :-----: | -| O(n) | O(n) | O(1) | O(n) | -======= | Acesso | Pesquisa | Inserção | Remoção | | :----: | :------: | :------: | :-----: | | O(n) | O(n) | O(1) | O(n) | ->>>>>>> create portuguese translations ### Complexidade de Espaçø diff --git a/src/data-structures/priority-queue/README.md b/src/data-structures/priority-queue/README.md index fdbdf9cc..b08e884f 100644 --- a/src/data-structures/priority-queue/README.md +++ b/src/data-structures/priority-queue/README.md @@ -1,7 +1,10 @@ # Priority Queue _Read this in other languages:_ -[_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) | [_日本語_](README.ja-JP.md) | [_Português_](README.pt-BR.md) +[_简体中文_](README.zh-CN.md), +[_Русский_](README.ru-RU.md), +[_日本語_](README.ja-JP.md), +[_Português_](README.pt-BR.md) In computer science, a **priority queue** is an abstract data type which is like a regular queue or stack data structure, but where diff --git a/src/data-structures/priority-queue/README.pt-BR.md b/src/data-structures/priority-queue/README.pt-BR.md index 033d4303..9e836bde 100644 --- a/src/data-structures/priority-queue/README.pt-BR.md +++ b/src/data-structures/priority-queue/README.pt-BR.md @@ -1,8 +1,5 @@ # Fila de Prioridade (Priority Queue) -_Leia em outro idioma:_ -[_English_](README.md) | [_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) - Na ciência da computação, uma **fila de prioridade** é um tipo de dados abastrato que é como uma fila regular (regular queue) ou estrutura de dados de pilha (stack), mas adicionalmente cada elemento possui uma diff --git a/src/data-structures/queue/README.md b/src/data-structures/queue/README.md index fdcc94b8..c546d8be 100644 --- a/src/data-structures/queue/README.md +++ b/src/data-structures/queue/README.md @@ -1,7 +1,10 @@ # Queue _Read this in other languages:_ -[_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) | [_日本語_](README.ja-JP.md) | [_Português_](README.pt-BR.md) +[_简体中文_](README.zh-CN.md), +[_Русский_](README.ru-RU.md), +[_日本語_](README.ja-JP.md), +[_Português_](README.pt-BR.md) In computer science, a **queue** is a particular kind of abstract data type or collection in which the entities in the collection are diff --git a/src/data-structures/queue/README.pt-BR.md b/src/data-structures/queue/README.pt-BR.md index fa1dd57c..b86c9713 100644 --- a/src/data-structures/queue/README.pt-BR.md +++ b/src/data-structures/queue/README.pt-BR.md @@ -1,8 +1,5 @@ # Fila (Queue) -_Leia em outro idioma:_ -[_English_](README.md) | [_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) - Na ciência da computação, uma **fila** é um tipo particular de abstração de tipo de dado ou coleção em que as entidades na coleção são mantidas em ordem e a causa primária (ou única) de operações na coleção são a diff --git a/src/data-structures/stack/README.md b/src/data-structures/stack/README.md index 5207219a..1765f9b4 100644 --- a/src/data-structures/stack/README.md +++ b/src/data-structures/stack/README.md @@ -1,7 +1,10 @@ # Stack _Read this in other languages:_ -[_简体中文_](README.zh-CN.md), | [_Русский_](README.ru-RU.md) | [_日本語_](README.ja-JP.md) | [_Português_](README.pt-BR.md) +[_简体中文_](README.zh-CN.md), +[_Русский_](README.ru-RU.md), +[_日本語_](README.ja-JP.md), +[_Português_](README.pt-BR.md) In computer science, a **stack** is an abstract data type that serves as a collection of elements, with two principal operations: diff --git a/src/data-structures/stack/README.pt-BR.md b/src/data-structures/stack/README.pt-BR.md index f1012fbc..9390ea51 100644 --- a/src/data-structures/stack/README.pt-BR.md +++ b/src/data-structures/stack/README.pt-BR.md @@ -1,8 +1,5 @@ # Stack -_Leia em outro idioma:_ -[_English_](README.md) | [_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) - Na ciência da computação, um **stack** é uma estrutura de dados abstrata que serve como uma coleção de elementos com duas operações principais: diff --git a/src/data-structures/tree/README.md b/src/data-structures/tree/README.md index 2938f527..d2d338f4 100644 --- a/src/data-structures/tree/README.md +++ b/src/data-structures/tree/README.md @@ -1,7 +1,8 @@ # Tree _Read this in other languages:_ -[_简体中文_](README.zh-CN.md) | [_Português_](README.pt-BR.md) +[_简体中文_](README.zh-CN.md), +[_Português_](README.pt-BR.md) * [Binary Search Tree](binary-search-tree) * [AVL Tree](avl-tree) diff --git a/src/data-structures/tree/README.pt-BR.md b/src/data-structures/tree/README.pt-BR.md index 3654309f..905c419c 100644 --- a/src/data-structures/tree/README.pt-BR.md +++ b/src/data-structures/tree/README.pt-BR.md @@ -1,8 +1,5 @@ # Árvore (Tree) -_Leia em outro idioma:_ -[_English_](README.md) | [_简体中文_](README.zh-CN.md) - * [Árvore de Pesquisa Binária (Binary Search Tree)](binary-search-tree/README.pt-BR.md) * [Árvore AVL (AVL Tree)](avl-tree/README.pt-BR.md) * [Árvore Vermelha-Preta (Red-Black Tree)](red-black-tree/README.pt-BR.md) diff --git a/src/data-structures/tree/avl-tree/README.pt-BR.md b/src/data-structures/tree/avl-tree/README.pt-BR.md index 24df7a6f..9b9e9ffb 100644 --- a/src/data-structures/tree/avl-tree/README.pt-BR.md +++ b/src/data-structures/tree/avl-tree/README.pt-BR.md @@ -1,8 +1,5 @@ # Árvore AVL (AVL Tree) -_Leia em outro idioma:_ -[_English_](README.md) - Na ciência da computação, uma **árvore AVL** (em homenagem aos inventores Adelson-Velsky e Landis) é uma árvore de pesquisa binária auto balanceada. Foi a primeira estrutura de dados a diff --git a/src/data-structures/tree/binary-search-tree/README.pt-BR.md b/src/data-structures/tree/binary-search-tree/README.pt-BR.md index be49740d..4565538a 100644 --- a/src/data-structures/tree/binary-search-tree/README.pt-BR.md +++ b/src/data-structures/tree/binary-search-tree/README.pt-BR.md @@ -1,8 +1,5 @@ # Árvore de Pesquisa Binária (Binary Search Tree) -_Leia em outro idioma:_ -[_English_](README.md) - Na ciência da computação **binary search trees** (BST), algumas vezes chamadas de árvores binárias ordenadas (_ordered or sorted binary trees_), é um tipo particular de container: estruturas de dados que armazenam diff --git a/src/data-structures/tree/fenwick-tree/README.md b/src/data-structures/tree/fenwick-tree/README.md index eb000d87..14129caa 100644 --- a/src/data-structures/tree/fenwick-tree/README.md +++ b/src/data-structures/tree/fenwick-tree/README.md @@ -1,7 +1,7 @@ # Fenwick Tree / Binary Indexed Tree -_Leia em outro idioma:_ -[_English_](README.pt-BR.md) +_Read this in other languages:_ +[_Português_](README.pt-BR.md) A **Fenwick tree** or **binary indexed tree** is a data structure that can efficiently update elements and diff --git a/src/data-structures/tree/fenwick-tree/README.pt-BR.md b/src/data-structures/tree/fenwick-tree/README.pt-BR.md index 2cba98be..b76bbc0f 100644 --- a/src/data-structures/tree/fenwick-tree/README.pt-BR.md +++ b/src/data-structures/tree/fenwick-tree/README.pt-BR.md @@ -1,8 +1,5 @@ # Árvore Fenwick / Árvore Binária Indexada (Fenwick Tree / Binary Indexed Tree) -_Read this in other languages:_ -[_Português_](README.md) - Uma **árvore Fenwick** ou **árvore binária indexada** é um tipo de estrutura de dados que consegue eficiemente atualizar elementos e calcular soma dos prefixos em uma tabela de números. diff --git a/src/data-structures/tree/red-black-tree/README.md b/src/data-structures/tree/red-black-tree/README.md index e065dace..566089f9 100644 --- a/src/data-structures/tree/red-black-tree/README.md +++ b/src/data-structures/tree/red-black-tree/README.md @@ -1,7 +1,7 @@ # Red–Black Tree -_Leia em outro idioma:_ -[_English_](README.pt-BR.md) +_Read this in other languages:_ +[_Português_](README.pt-BR.md) A **red–black tree** is a kind of self-balancing binary search tree in computer science. Each node of the binary tree has diff --git a/src/data-structures/tree/red-black-tree/README.pt-BR.md b/src/data-structures/tree/red-black-tree/README.pt-BR.md index 94f56f7f..6c80def9 100644 --- a/src/data-structures/tree/red-black-tree/README.pt-BR.md +++ b/src/data-structures/tree/red-black-tree/README.pt-BR.md @@ -1,8 +1,5 @@ # Árvore Vermelha-Preta (Red-Black Tree) -_Read this in other languages:_ -[_Português_](README.md) - Uma **árvore vermelha-preta** é um tipo de árvore de pesquisa binária auto balanceada na ciência da computação. Cada nó da árvore binária possui um _bit_ extra, e este _bit_ é frequentemente diff --git a/src/data-structures/tree/segment-tree/README.md b/src/data-structures/tree/segment-tree/README.md index 0842b598..319414c3 100644 --- a/src/data-structures/tree/segment-tree/README.md +++ b/src/data-structures/tree/segment-tree/README.md @@ -1,7 +1,7 @@ # Segment Tree -_Leia em outro idioma:_ -[_English_](README.pt-BR.md) +_Read this in other languages:_ +[_Português_](README.pt-BR.md) In computer science, a **segment tree** also known as a statistic tree is a tree data structure used for storing information about intervals, diff --git a/src/data-structures/tree/segment-tree/README.pt-BR.md b/src/data-structures/tree/segment-tree/README.pt-BR.md index 6ddc6c0f..d4d6eb94 100644 --- a/src/data-structures/tree/segment-tree/README.pt-BR.md +++ b/src/data-structures/tree/segment-tree/README.pt-BR.md @@ -1,8 +1,5 @@ # Árvore de Segmento (Segment Tree) -_Read this in other languages:_ -[_Português_](README.md) - Na ciência da computação, uma **árvore de segmento** também conhecida como árvore estatística é uma árvore de estrutura de dados utilizadas para armazenar informações sobre intervalores ou segmentos. Ela permite pesquisas diff --git a/src/data-structures/trie/README.md b/src/data-structures/trie/README.md index c3b2eb48..d07c69fe 100644 --- a/src/data-structures/trie/README.md +++ b/src/data-structures/trie/README.md @@ -1,7 +1,9 @@ # Trie _Read this in other languages:_ -[_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) | [_Português_](README.pt-BR.md) +[_简体中文_](README.zh-CN.md), +[_Русский_](README.ru-RU.md), +[_Português_](README.pt-BR.md) In computer science, a **trie**, also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), diff --git a/src/data-structures/trie/README.pt-BR.md b/src/data-structures/trie/README.pt-BR.md index c2eb1317..7a141581 100644 --- a/src/data-structures/trie/README.pt-BR.md +++ b/src/data-structures/trie/README.pt-BR.md @@ -1,8 +1,5 @@ # Trie -_Leia em outro idioma:_ -[_English_](README.md) | [_简体中文_](README.zh-CN.md) | [_Русский_](README.ru-RU.md) - Na ciência da computação, uma **trie**, também chamada de árvore digital (digital tree) e algumas vezes de _radix tree_ ou _prefix tree_ (tendo em vista que eles podem ser pesquisados por prefixos), é um tipo de árvore de pesquisa, uma