Fix linting errors (TheAlgorithms#207)

Co-authored-by: David Leal <halfpacho@gmail.com>

Author: siriak

.github/CODEOWNERS

@@ -0,0 +1 @@
+* @siriak

src/data_structures/b_tree.rs

@@ -112,7 +112,7 @@ impl BTreeProps {
                 // And https://stackoverflow.com/a/35280799/2849127
                 print!("{0:{<1$}{2:?}{0:}<1$}", "", depth, key);
             }
-            self.traverse_node(&node.children.last().unwrap(), _depth);
+            self.traverse_node(node.children.last().unwrap(), _depth);
         }
     }
 }

src/data_structures/binary_search_tree.rs

@@ -39,7 +39,7 @@ where
     pub fn search(&self, value: &T) -> bool {
         match &self.value {
             Some(key) => {
-                match key.cmp(&value) {
+                match key.cmp(value) {
                     Ordering::Equal => {
                         // key == value
                         true
@@ -123,7 +123,7 @@ where
     pub fn floor(&self, value: &T) -> Option<&T> {
         match &self.value {
             Some(key) => {
-                match key.cmp(&value) {
+                match key.cmp(value) {
                     Ordering::Greater => {
                         // key > value
                         match &self.left {
@@ -138,13 +138,13 @@ where
                                 let val = node.floor(value);
                                 match val {
                                     Some(_) => val,
-                                    None => Some(&key),
+                                    None => Some(key),
                                 }
                             }
-                            None => Some(&key),
+                            None => Some(key),
                         }
                     }
-                    Ordering::Equal => Some(&key),
+                    Ordering::Equal => Some(key),
                 }
             }
             None => None,
@@ -155,7 +155,7 @@ where
     pub fn ceil(&self, value: &T) -> Option<&T> {
         match &self.value {
             Some(key) => {
-                match key.cmp(&value) {
+                match key.cmp(value) {
                     Ordering::Less => {
                         // key < value
                         match &self.right {
@@ -170,15 +170,15 @@ where
                                 let val = node.ceil(value);
                                 match val {
                                     Some(_) => val,
-                                    None => Some(&key),
+                                    None => Some(key),
                                 }
                             }
-                            None => Some(&key),
+                            None => Some(key),
                         }
                     }
                     Ordering::Equal => {
                         // key == value
-                        Some(&key)
+                        Some(key)
                     }
                 }
             }

src/general/convex_hull.rs

@@ -45,7 +45,7 @@ pub fn convex_hull_graham(pts: &[(f64, f64)]) -> Vec<(f64, f64)> {
             }
         })
         .unwrap();
-    let points = sort_by_min_angle(pts, &min);
+    let points = sort_by_min_angle(pts, min);
 
     if points.len() <= 3 {
         return points;

src/sorting/mod.rs

@@ -34,7 +34,7 @@ where
             return false;
         }
 
-        prev = &item;
+        prev = item;
     }
 
     true