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 8639231
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 12, 20262026-06-12T10:57:00+00:00 2026-06-12T10:57:00+00:00

I am trying to implement a binary search tree by reading lines from a

  • 0

I am trying to implement a binary search tree by reading lines from a file.

  while(fgets(p, 1024, fp))
  {
     struct node child;
     child.str = (char *)malloc(plen);      
     strcpy(child.str,p);
     insert(&tree,&child);
  }

Now the problem is that I can not seem to find a way to make a complete new copy of child, instead it just changes its values every time the while loop restarts.

  • 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-12T10:57:01+00:00Added an answer on June 12, 2026 at 10:57 am

    That’s because the pointer-to-child (&child) isn’t changing. You can convince yourself of this by printing it out:

    printf("address of child = %p\n", &child);
    

    Solution: You also need to allocate the node as well:

    struct node*child = malloc(sizeof(struct node));
    

    You can then assign child.str as you were, now using pointer-syntax:

    child->str = (char *)malloc(plen);      
    strcpy(child->str,p);
    

    …and because the child is a pointer, you don’t need the ampersand here:

    insert(&tree,child);
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I've been trying to implement a delete function for a Binary Search Tree but
I am trying to implement binary search tree operations and got stuck at deletion.
Alright, so I've been trying to implement a simple binary search tree that uses
I am trying to implement a binary search tree. Here is the code I
I was trying to implement binary search tree but I think I have made
I'm trying to implement a binary search tree class, but the compiler is throwing
I was trying to implement a simple Binary Search Tree for practice. I tried
I'm quite new to C and I'm trying to implement a binary tree in
I'm trying to implement a method for a binary tree which returns a stream.
I am trying to connect the siblings of the binary search tree. You can

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.