Fix build and update README (TheAlgorithms#202)

Author: siriak

README.md

@@ -1,77 +1,83 @@
 # The Algorithms - Rust [![Gitter](https://img.shields.io/gitter/room/the-algorithms/rust.svg?style=flat-square)](https://gitter.im/the-algorithms/rust) [![Build Status](https://travis-ci.com/TheAlgorithms/Rust.svg?branch=master)](https://travis-ci.com/TheAlgorithms/Rust)
 
-### All algorithms implemented in Rust (for educational purposes)
+<img src="https://upload.wikimedia.org/wikipedia/commons/thumb/d/d5/Rust_programming_language_black_logo.svg/1024px-Rust_programming_language_black_logo.svg.png" width="200" height="200">
+
+
 
+### All algorithms implemented in Rust (for educational purposes)
 These are for demonstration purposes only.
 
 ## [Sort Algorithms](./src/sorting)
 
-- [Bubble](./src/sorting/bubble_sort.rs)
-- [Counting](./src/sorting/counting_sort.rs)
-- [Heap](./src/sorting/heap_sort.rs)
-- [Insertion](./src/sorting/insertion_sort.rs)
-- [Merge](./src/sorting/merge_sort.rs)
-- [Quick](./src/sorting/quick_sort.rs)
-- [Radix](./src/sorting/radix_sort.rs)
-- [Selection](./src/sorting/selection_sort.rs)
-- [Shell](./src/sorting/shell_sort.rs)
+- [x] [Bubble](./src/sorting/bubble_sort.rs)
+- [x] [Counting](./src/sorting/counting_sort.rs)
+- [x] [Heap](./src/sorting/heap_sort.rs)
+- [x] [Insertion](./src/sorting/insertion_sort.rs)
+- [x] [Merge](./src/sorting/merge_sort.rs)
+- [x] [Quick](./src/sorting/quick_sort.rs)
+- [x] [Radix](./src/sorting/radix_sort.rs)
+- [x] [Selection](./src/sorting/selection_sort.rs)
+- [x] [Shell](./src/sorting/shell_sort.rs)
 
 ## Graphs
 
-- Dijkstra _(Not implemented yet)_
-- Kruskal's Minimum Spanning Tree _(Not implemented yet)_
-- Prim's Minimum Spanning Tree _(Not implemented yet)_
-- BFS _(Not implemented yet)_
-- DFS  _(Not implemented yet)_
+- [ ] Dijkstra
+- [ ] Kruskal's Minimum Spanning Tree
+- [ ] Prim's Minimum Spanning Tree
+- [ ] BFS
+- [ ] DFS
 
 ## [Dynamic Programming](./src/dynamic_programming)
 
-- [0-1 Knapsack](./src/dynamic_programming/knapsack.rs)
-- [Edit Distance](./src/dynamic_programming/edit_distance.rs)
-- [Longest common subsequence](./src/dynamic_programming/longest_common_subsequence.rs)
-- Longest increasing subsequence _(Not implemented yet)_
-- [K-Means Clustering](./src/general/kmeans.rs)
-- Coin Change _(Not implemented yet)_
-- Rod cut _(Not implemented yet)_
-- [Egg Dropping Puzzle](./src/dynamic_programming/egg_dropping.rs)
+- [x] [0-1 Knapsack](./src/dynamic_programming/knapsack.rs)
+- [x] [Edit Distance](./src/dynamic_programming/edit_distance.rs)
+- [x] [Longest common subsequence](./src/dynamic_programming/longest_common_subsequence.rs)
+- [ ] Longest increasing subsequence
+- [x] [K-Means Clustering](./src/general/kmeans.rs)
+- [ ] Coin Change
+- [ ] Rod cut
+- [x] [Egg Dropping Puzzle](./src/dynamic_programming/egg_dropping.rs)
 
-## Data Structures
+## [Data Structures](./src/data_structures)
 
-- Queue _(Not implemented yet)_
-- [Heap](./src/data_structures/heap.rs)
-- [Linked List](./src/data_structures/linked_list.rs)
-- Graph _(Not implemented yet)_
-  - Directed _(Not implemented yet)_
-  - Undirected _(Not implemented yet)_
-- Trie _(Not implemented yet)_
-- [Binary Search Tree](./src/data_structures/binary_search_tree.rs)
-- [B-Tree](./src/data_structures/b_tree.rs)
-- AVL Tree _(Not implemented yet)_
+- [ ] Queue
+- [x] [Heap](./src/data_structures/heap.rs)
+- [x] [Linked List](./src/data_structures/linked_list.rs)
+- Graph
+  - [ ] Directed
+  - [ ] Undirected
+- [ ] Trie
+- [x] [Binary Search Tree](./src/data_structures/binary_search_tree.rs)
+- [x] [B-Tree](./src/data_structures/b_tree.rs)
+- [ ] AVL Tree
 
-## Strings
+## [Strings](./src/string)
 
-- [Knuth Morris Pratt](./src/string/knuth_morris_pratt.rs)
-- Rabin Carp _(Not implemented yet)_
+- [x] [Knuth Morris Pratt](./src/string/knuth_morris_pratt.rs)
+- [ ] Rabin Carp
 
-## General
+## [General](./src/general)
 
-- [Convex Hull: Graham Scan](./src/general/convex_hull.rs)
-- N-Queensp _(Not implemented yet)_
-- Graph Coloringp _(Not implemented yet)_
-- [Tower of Hanoi](./src/general/hanoi.rs)
+- [x] [Convex Hull: Graham Scan](./src/general/convex_hull.rs)
+- [ ] N-Queensp
+- [ ] Graph Coloringp
+- [x] [Tower of Hanoi](./src/general/hanoi.rs)
 
 ## [Search Algorithms](./src/searching)
 
-- [Linear](./src/searching/linear_search.rs)
-- [Binary](./src/searching/binary_search.rs)
+- [x] [Linear](./src/searching/linear_search.rs)
+- [x] [Binary](./src/searching/binary_search.rs)
 
 ## [Ciphers](./src/ciphers)
 
-- [Caesar](./src/ciphers/caesar.rs)
-- [Vigenère](./src/ciphers/vigenere.rs)
-- Transposition _(Not implemented yet)_
+- [x] [Caesar](./src/ciphers/caesar.rs)
+- [x] [Vigenère](./src/ciphers/vigenere.rs)
+- [ ] Transposition
 
 ---
+
+### All implemented Algos
+See [DIRECTORY.md](./DIRECTORY.md)
 ### Contributing
 
 See [CONTRIBUTING.md](CONTRIBUTING.md)

src/data_structures/binary_search_tree.rs

@@ -102,7 +102,7 @@ where
         match &self.left {
             Some(node) => node.minimum(),
             None => match &self.value {
-                Some(value) => Some(&value),
+                Some(value) => Some(value),
                 None => None,
             },
         }
@@ -113,7 +113,7 @@ where
         match &self.right {
             Some(node) => node.maximum(),
             None => match &self.value {
-                Some(value) => Some(&value),
+                Some(value) => Some(value),
                 None => None,
             },
         }