Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8262611
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 8, 20262026-06-08T03:48:37+00:00 2026-06-08T03:48:37+00:00

void BST::insert(string word) { insert(buildWord(word),root); } //Above is the gateway insertion function that calls

  • 0
void BST::insert(string word)
{
   insert(buildWord(word),root);
}
  //Above is the gateway insertion function that calls the function below
  //in order to build the Node, then passes the Node into the insert function
  //below that

Node* BST::buildWord(string word)
{
   Node* newWord = new Node;
   newWord->left = NULL;
   newWord->right = NULL;
   newWord->word = normalizeString(word);

   return newWord;
}
   //The normalizeString() returns a lowercase string, no problems there

void BST::insert(Node* newWord,Node* wordPntr)
{
  if(wordPntr == NULL)
  {
  cout << "wordPntr is NULL" << endl;
  wordPntr = newWord;
  cout << wordPntr->word << endl;
  }
  else if(newWord->word.compare(wordPntr->word) < 0)
  {
     cout << "word alphabetized before" << endl;
     insert(newWord,wordPntr->left);
  }
  else if(newWord->word.compare(wordPntr->word) > 0)
  {
     cout << "word alphabetized after" << endl;
     insert(newWord, wordPntr->right);
  }
  else
  {
     delete newWord;
  }
}

So my problem is this: I call the gateway insert() externally (also no problems with the inflow of data) and every time it tells me that the root, or the initial Node* is NULL. But that should only be the case before the first insert. Each time the function is called, it sticks the newWord right at the root.
To clarify: These functions are part of the BST class, and root is a Node* and a private member of BST.h

It’s possible it is quite obvious, and I have just been staring too long. Any help would be appreciated.
Also, this is a school-assigned project.

Best

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-08T03:48:39+00:00Added an answer on June 8, 2026 at 3:48 am

    Like user946850 says, the variable wordPntr is a local variable, if you change it to point to something else it will not be reflected in the calling function.

    There are two ways of fixing this:

    1. The old C way, by using a pointer to a pointer:

      void BST::insert(Node *newWord, Node **wordPntr)
      {
          // ...
          *wordPntr = newWord;
          // ...
      }
      

      You call it this way:

      some_object.insert(newWord, &rootPntr);
      
    2. Using C++ references:

      void BST::insert(Node *newWord, Node *&wordPntr)
      {
          // Nothing here or in the caller changes
          // ...
      }
      

    To help you understand this better, I suggest you read more about scope and lifetime of variables.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Suppose I got an external library bst that handles custom data types insertion in
hi I was writing a BST and wrote following function for adding Child. void
typedef struct node { struct node *leftChild, *rightChild; int value; } bst; void insert(bst*
Given the following algorithm for inserting elements into BST : void InsertNode(Node* &treeNode, Node
I have this function to find all the paths from root to leaf in
I have been trying to implement the delete BST function but I don't know
I'm trying to make a balance_bst(bstNode root) function, but i'm struggling with the implementation.
I've got a BST AVL, in Java, that I need to prove is balanced
(void) fputs( line, stdout ); (void) alarm( TIMEOUT ); The above appears in the
void foo (void *p); // library function; can't edit template<typename T> void Remove (T

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.