1、题目描述
要求:给定一个二叉搜索树(BST)和一个整数值val。要求返回节点值等于val的节点(所在子树),若不存在就返回null。
2、分析
分析:其实就是二分查找。没啥可说的。
2.1、迭代实现
class Solution {
public:
TreeNode* searchBST(TreeNode* root, int val) {
while(root){
if(root->val == val){
return root;
}else if(root->val < val){
root = root->right;
}else if(root->val > val){
root = root->left;
}
}
return NULL;
}
};
2.2、递归实现
class Solution {
public:
//1.函数的入参及返回值就用这个
TreeNode* searchBST(TreeNode* root, int val) {
//2.进入函数后首先明确退出条件
if(root == NULL) return NULL;
if(root->val == val) return root;
//3.然后看看处理逻辑.
//①如果val值大于root节点的值,说明要在右子树中搜
if(root->val < val){
return searchBST(root->right, val);
//②如果val值小于root节点的值,说明要在左子树中搜
}else{
return searchBST(root->left, val);
}
}
};
3、实现代码
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <math.h>
using namespace std;
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* searchBST(TreeNode* root, int val) {
while(root){
if(root->val == val){
return root;
}else if(root->val < val){
root = root->right;
}else if(root->val > val){
root = root->left;
}
}
return NULL;
}
};
int main()
{
Solution s1;
TreeNode node4(1);
TreeNode node5(3);
TreeNode node3(7);
TreeNode* pnode2 = new TreeNode(2, &node4, &node5);
TreeNode root(4, pnode2, &node3);
int val = 6;
TreeNode* dstnode = s1.searchBST(&root, val);
if(dstnode){
cout << "dstnode->val:" << dstnode->val << endl;
}else{
cout << "null!" << endl;
}
}