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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 22, 20262026-05-22T20:09:49+00:00 2026-05-22T20:09:49+00:00

I have the BST class same as in this thread BST.hpp template<class T> class

  • 0

I have the BST class same as in this thread

BST.hpp

template<class T> 
class BinarySearchTree
{
 private:
  struct tree_node
  {
    tree_node* left;
    tree_node* right;
    T data;

    tree_node( const T & thedata, tree_node * l = NULL, tree_node * r = NULL )
            : data( thedata ), left( l ), right( r ) { }
  };
tree_node* root;

public:
  //some functions
private:
  struct tree_node* minFunc( tree_node** node);
};

I was trying to return a pointer from the function as done in this thread.

the definition of minFunc is in the same BST.hpp file

template <class T>
struct tree_node* BST<T>::minFunc(tree_node** node)
{
tree_node* current = *node;
while(current->left != NULL)
{
    current = current->left;
}
return current;
}

Unable to figure out the compile errors:

error C2143: syntax error : missing ‘;’ before ‘*’

error C2065: ‘T’ : undeclared identifier

error C2955: ‘BST’ : use of class template requires template argument list

error C2509: ‘minFunc’ : member function not declared in ‘BST’

all these pointing to the definition

  • 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-22T20:09:50+00:00Added an answer on May 22, 2026 at 8:09 pm
    1. Change this declaration :

      struct tree_node* minFunc( tree_node** node);

    into this

    tree_node* minFunc( tree_node** node);
    

    Change it’s definition accordingly.

    1. Double pointer is a sure sign of bad design
    2. Did you include a header defining struct tree_node?

    EDIT

    The definition should be

    template <class T>
    typename BST<T>::tree_node* BST<T>::minFunc(tree_node** node)
    {
    tree_node* current = *node;
    while(current->left != NULL)
    {
        current = current->left;
    }
    return current;
    }
    

    by the way, take a note that the method minFunc is private and cant access it outside of the class

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

Sidebar

Related Questions

I have this code fragment class bst { public node root=null; bst() { root=null;
template <class T> bool BST<T>::search(const T& x, int& len) const { return search(BT<T>::root, x);
I have created a BST full of WordInfo objects that have a vector to
Have you managed to get Aptana Studio debugging to work? I tried following this,
Assume that my delete tries to rebalance the tree inorder (left to right). I'm
I have been using a driver to test one of my data structures(Binary Search
I have a native C/C++ struct typedef struct { ... } AStruct; and in
I have the timezone set on the server to BST (British Daylight Savings Time),
Have you noticed that every 10 questions on this site is about jQuery? Anyway...
Have just started using Google Chrome , and noticed in parts of our site,

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.