Merge pull request #36 from shynutpirate/master

Solution for human traffic of stadium

cpp/700_Search_in_BST.cpp

@@ -0,0 +1,21 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    TreeNode* searchBST(TreeNode* root, int val) {
+        if (root == NULL)
+            return NULL;
+        if (root->val > val)
+            return searchBST(root->left,val);
+        else if (root->val < val)
+            return searchBST(root->right,val);
+        return root;
+    }
+};

sql/601_Human_Traffic_of_Stadium.sql

@@ -0,0 +1,8 @@
+select s1.* from stadium as s1, stadium as s2, stadium as s3
+where ((s2.id = s1.id + 1 and s3.id =s1.id + 2)
+or (s2.id = s1.id - 1 and s3.id = s1.id + 1)
+or (s2.id = s1.id - 2 and s3.id = s1.id - 1))
+and s1.people >= 100
+and s2.people >= 100
+and s3.people >= 100
+Group by(s1.id);