Update KthSmallestBST.py

Author: careermonk

src/chapter06trees/KthSmallestBST.py

@@ -90,7 +90,7 @@ def preOrderTraversal(root):
 def kthSmallestInBST(root, k):
 	global count
 	if(not root): 
-		return None;
+		return None
 	left = kthSmallestInBST(root.left, k)
 	if(left): 
 		return left