From 4617d9401be60101c12e100f428c0b460de0a210 Mon Sep 17 00:00:00 2001
From: jinthislife <8064873+jinthislife@users.noreply.github.com>
Date: Mon, 11 May 2020 15:30:38 +1000
Subject: [PATCH] Update README.markdown

remove duplicate parameter
---
 Binary Search Tree/README.markdown | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Binary Search Tree/README.markdown b/Binary Search Tree/README.markdown
index 0b382f204..57d1f4bff 100644
--- a/Binary Search Tree/README.markdown	
+++ b/Binary Search Tree/README.markdown	
@@ -557,7 +557,7 @@ As a result, doing `tree.search(100)` gives nil.
 You can check whether a tree is a valid binary search tree with the following method:
 
 ```swift
-  public func isBST(minValue minValue: T, maxValue: T) -> Bool {
+  public func isBST(minValue: T, maxValue: T) -> Bool {
     if value < minValue || value > maxValue { return false }
     let leftBST = left?.isBST(minValue: minValue, maxValue: value) ?? true
     let rightBST = right?.isBST(minValue: value, maxValue: maxValue) ?? true