DSA/C++/LeetCode/0700.cpp at main · spycedcoffee/DSA · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* dfs(TreeNode* root, int val){

        if(!root)
            return NULL;

        if(root -> val == val)
            return root;

        if(root -> val < val)
            return dfs(root -> right, val);

        else
            return dfs(root -> left, val);
    }

    TreeNode* searchBST(TreeNode* root, int val) {
        return dfs(root, val);
    }
};