Skip to content

Commit

Permalink
Fixing badges
Browse files Browse the repository at this point in the history
  • Loading branch information
@niclashedam
niclashedam committed Feb 2, 2020
1 parent 2f564da commit 916df8f
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions README.md
View file
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
# A binary search tree (BST) implementation in Scala
[![Build Status](https://travis-ci.org/NiclasHedam/scala-binary-search-tree.svg?branch=master)](https://travis-ci.org/NiclasHedam/scala-binary-search-tree)
[![Coverage Status](https://coveralls.io/repos/github/NiclasHedam/scala-binary-search-tree/badge.svg?branch=master)](https://coveralls.io/github/NiclasHedam/scala-binary-search-tree?branch=master)
[![Build Status](https://travis-ci.org/NiclasHedam/scala-binary-search-tree.svg?branch=master)](https://travis-ci.org/niclashedam/scala-binary-search-tree)
[![Coverage Status](https://coveralls.io/repos/github/NiclasHedam/scala-binary-search-tree/badge.svg?branch=master)](https://coveralls.io/github/niclashedam/scala-binary-search-tree?branch=master)

This is an implementation of a Binary Search Tree in Scala. A BST is a tree
data structure that provides an average of logarithmic performance for finding,
Expand Down

0 comments on commit 916df8f

Please sign in to comment.