From ed00b5b80356e8478829fc28de344fee4b04222a Mon Sep 17 00:00:00 2001 From: Manan Date: Tue, 7 Jan 2020 13:45:41 -0800 Subject: [PATCH] Fixed Markdown link formatting. The Wikipedia links had parentheses that clashed with the Markdown syntax of displaying links. Fixed by adding a closing `)` bracket. --- Readme.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/Readme.md b/Readme.md index 8e32ec6..bcfa4a4 100644 --- a/Readme.md +++ b/Readme.md @@ -3,10 +3,10 @@ Maps and slices go a long way in Go, but sometimes you need more. This is a collection of collections that may be useful. ## Queue -A [queue](http://en.wikipedia.org/wiki/Queue_(data_structure%29) is a first-in first-out data structure. +A [queue](http://en.wikipedia.org/wiki/Queue_(data_structure%29)) is a first-in first-out data structure. ## Set -A [set](http://en.wikipedia.org/wiki/Set_(computer_science%29) is an unordered collection of unique values typically used for testing membership. +A [set](http://en.wikipedia.org/wiki/Set_(computer_science%29)) is an unordered collection of unique values typically used for testing membership. ## Skip list A [skip list](http://en.wikipedia.org/wiki/Skip_list) is a data structure that stores nodes in a hierarchy of linked lists. It gives performance similar to binary search trees by using a random number of forward links to skip parts of the list. @@ -23,4 +23,4 @@ A [trie](http://en.wikipedia.org/wiki/Trie) is a type of tree where each node re ## Ternary Search Tree -A [ternary search tree](http://en.wikipedia.org/wiki/Ternary_search_tree) is similar to a trie in that nodes store the letters of the key, but instead of either using a list or hash at each node a binary tree is used. Ternary search trees have the performance benefits of a trie without the usual memory costs. \ No newline at end of file +A [ternary search tree](http://en.wikipedia.org/wiki/Ternary_search_tree) is similar to a trie in that nodes store the letters of the key, but instead of either using a list or hash at each node a binary tree is used. Ternary search trees have the performance benefits of a trie without the usual memory costs.