700. Search in a Binary Search Tree的C++解法

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/musechipin/article/details/81705352

class Solution {
public:
	TreeNode* searchBST(TreeNode* root, int val) {
        if (root == NULL) return NULL;
		if (root->val == val) return root;
		else {
			if (root->val < val) { return searchBST(root->right, val); }
	        if (root->val > val) { return searchBST(root->left, val); }
        }
	}
};