text: // Hi, I'm Yanzhan. For more algothmic problems, visit my Youtube Channel (Yanzhan Yang's Youtube Channel) : https://www.youtube.com/channel/UCDkz-__gl3frqLexukpG0DA?view_as=subscriber or my Twitter Account (Yanzhan Yang's Twitter) : https://twitter.com/YangYanzhan or my GitHub HomePage (Yanzhan Yang's GitHub HomePage) : https://yanzhan.site .
  // For this specific algothmic problem, visit my Youtube Video :  .
  // It's fascinating to solve algothmic problems, follow Yanzhan to learn more!
  // Blog URL for this problem: https://yanzhan.site/codewars/binary-tree-search-not-bst.html .
  
  using namespace std;
  
  struct Node {
      int val;
      Node *left = nullptr;
      Node *right = nullptr;
  };
  
  bool search(int n, Node *root) {
      if (root == nullptr) {
          return false;
      }
      if (root->val == n) {
          return true;
      }
      return search(n, root->left) || search(n, root->right);
  }
  