Fixed the bug in kth smallest element in BST problem

mandliya · mandliya · commit 76118e6c0af0 · 2018-01-08T00:00:31.000-08:00
diff --git a/tree_problems/kth_smallest.cpp b/tree_problems/kth_smallest.cpp
@@ -36,7 +36,7 @@ int kthSmallest(TreeNode* root, int k)
     int count = countNodes(root->left);
     if (k <= count && root->left) {
         return kthSmallest(root->left, k);
-    } else if ( k + 1 >= count && root->right) {
+    } else if ( k > count + 1 && root->right) {
         return kthSmallest(root->right, k - count - 1);
     }
     return root->data;

Original file line number	Diff line number	Diff line change
`@@ -36,7 +36,7 @@ int kthSmallest(TreeNode* root, int k)`
`36`	`36`	`int count = countNodes(root->left);`
`37`	`37`	`if (k <= count && root->left) {`
`38`	`38`	`return kthSmallest(root->left, k);`
`39`		`- } else if ( k + 1 >= count && root->right) {`
	`39`	`+ } else if ( k > count + 1 && root->right) {`
`40`	`40`	`return kthSmallest(root->right, k - count - 1);`
`41`	`41`	`}`
`42`	`42`	`return root->data;`