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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T16:03:54+00:00 2026-05-26T16:03:54+00:00

I have to implement a binary search tree using C++ for one of assignments.

  • 0

I have to implement a binary search tree using C++ for one of assignments. I’ve created the class, and attempted to implement the InsertItem, PrintTree, DeleteTree methods for the class, I think I did everything right but for some reason my program keeps crashing 🙁

Here’s my code:

PrintTree Method

template <class TItem>
void BinarySearchTree<TItem>::PrintTree()
{
    PrintTree(RootNode);
}

template <class TItem>
void BinarySearchTree<TItem>::PrintTree(BinarySearchTreeNode* Node)
{
    if(Node == NULL)
        return;

    cout << Node->Data << endl;
    PrintTree(Node->LeftChild);
    PrintTree(Node->RightChild);
}

DeleteTree Method

template <class TItem>
void BinarySearchTree<TItem>::DeleteTree()
{
    DeleteTree(RootNode);
}

template <class TItem>
void BinarySearchTree<TItem>::DeleteTree(BinarySearchTreeNode* Node)
{
    if(Node == NULL)
        return;

    DeleteTree(Node->LeftChild);
    DeleteTree(Node->RightChild);

    delete Node;
}

My sequence of method calls up until the program crashes:

I insert items F,B,G,A,D,I,C,E,H: works fine

I call PrintTree(): works fine

I call DeleteTree(): works fine

I call PrintTree() again: program crashes

For some reason the expression if(RootNode == NULL) is not returning true after the DeleteTree() method is called, so the program tries to print something that doesn’t exist and crashes. I’m not sure why this is happening, what am I doing wrong here?

Any and all help is appreciated.

  • 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-05-26T16:03:54+00:00Added an answer on May 26, 2026 at 4:03 pm

    Calling “delete” does not null out the pointer.
    You will want to do:

    delete Node; 
    Node = nullptr;
    

    EDIT:

    Pass the pointer by address so that you can clean up dangling pointers as you go:

    void BinarySearchTree<TItem>::DeleteTree(BinarySearchTreeNode *&node);
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

i have implement binary search tree in c++ #include <iostream> #include <cstdlib> using namespace
I was trying to implement binary search tree but I think I have made
I have data that has been stored using binary serialization for the following class:
Hey guys, I have created a tree which is not a binary tree. Now,
I have to implement a class that behaves like a map of strings using
So recently I have been working on phonebook project that uses Binary Search Tree.
I have implemented a binary search tree and I want to add more functionality
I am trying to implement a binary search tree. Here is the code I
I have a Binary Search Tree that I'm making and I implemented the Insert
Alright, so I've been trying to implement a simple binary search tree that uses

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.