Create main.cpp

Author: JawadSher

18 - Binary Search Tree Data Structure Problems/08 - Kth Largest Element in BST/main.cpp

@@ -0,0 +1,21 @@
+class Solution {
+  public:
+     int solve(Node* root, int &i, int k){
+        if(root == NULL) return -1;
+
+        int right = solve(root -> right, i, k);
+        if(right != -1) return right;
+
+        i++;
+        if(i == k) return root -> data;
+
+        return solve(root -> left, i, k);
+    }
+    
+    int kthLargest(Node *root, int k) {
+        int i = 0;
+        int ans = solve(root, i, k);
+
+        return ans;
+    }
+};