fork download
copy 
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. class TreeNode {
  5. public:
  6.     int value;
  7.     TreeNode* left;
  8.     TreeNode* right;
  9.  
  10.     TreeNode(int val) {
  11.         value = val;
  12.         left = right = nullptr;
  13.     }
  14. };
  15.  
  16. TreeNode* insert(TreeNode* root, int value) {
  17.     // Base case: if the tree is empty, create a new node
  18.     if (root == nullptr) {
  19.         return new TreeNode(value);
  20.     }
  21.  
  22.     // Recursively find the correct position to insert the new value
  23.     if (value < root->value) {
  24.         root->left = insert(root->left, value);  // Insert in the left subtree
  25.     } else {
  26.         root->right = insert(root->right, value);  // Insert in the right subtree
  27.     }
  28.  
  29.     return root;  // Return the root of the tree
  30. }
  31.  
  32. bool searchBST(TreeNode* root, int target) {
  33.     // Base case: if the root is null or we found the target
  34.     if (root == nullptr) {
  35.         return false;
  36.     }
  37.     if (root->value == target) {
  38.         return true;
  39.     }
  40.  
  41.     // Recursively search the left or right subtree based on the target
  42.     if (target < root->value) {
  43.         return searchBST(root->left, target);
  44.     } else {
  45.         return searchBST(root->right, target);
  46.     }
  47. }
  48.  
  49. int main() {
  50.     TreeNode* root = nullptr;
  51.     int n, value, target;
  52.  
  53.     cin >> n;  // number of nodes
  54.     for (int i = 0; i < n; i++) {
  55.         cin >> value;  // node values
  56.         root = insert(root, value);  // Insert the value into the tree
  57.     }
  58.  
  59.     cin >> target;  // target value to search
  60.     cout << (searchBST(root, target) ? "true" : "false") << endl;  // Search for the target
  61.  
  62.     return 0;
  63. }
  64.  
Success #stdin #stdout 0s 5288KB
comments (?)
stdin
copy 
6
10 5 15 3 7 20
7
stdout
copy 
true
https://ideone.com/kpSmSe
You are given a binary search tree (BST), and you need to implement a function to search for a target value in the tree. If the target value exists in the tree, return True, otherwise return False.

language:
C++ (gcc 8.3)
created:
21 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!