Explain This: BST_TREE* BST_Create(int (*compare)(void* argu1, void* argu2));
up vote
0
down vote
favorite
I can't understand the argument, i've seen it for the 1st time.
below is the structure:
typedef struct node{
void* dataPtr;
struct node* left;
struct node* right;
}NODE;
typedef struct{
int count;
int (*compare)(void* argu1, void* argu2);
NODE* root;
}BST_TREE;
This is Prototype:
BST_TREE* BST_Create(int (*compare)(void* argu1, void* argu2));
This is Function:
BST_TREE* BST_Create(int (*compare)(void* argu1, void *argu2)){
BST_TREE* tree;
tree = (BST_TREE*)malloc(sizeof(BST_TREE));
if(tree){
tree->root = NULL;
tree->count = 0;
tree->compare = compare;
}
return tree;
}
c
asked Nov 21 at 17:22
Rahul Bhaskar
65
add a comment |
up vote
0
down vote
favorite
I can't understand the argument, i've seen it for the 1st time.
below is the structure:
typedef struct node{
void* dataPtr;
struct node* left;
struct node* right;
}NODE;
typedef struct{
int count;
int (*compare)(void* argu1, void* argu2);
NODE* root;
}BST_TREE;
This is Prototype:
BST_TREE* BST_Create(int (*compare)(void* argu1, void* argu2));
This is Function:
BST_TREE* BST_Create(int (*compare)(void* argu1, void *argu2)){
BST_TREE* tree;
tree = (BST_TREE*)malloc(sizeof(BST_TREE));
if(tree){
tree->root = NULL;
tree->count = 0;
tree->compare = compare;
}
return tree;
}
c
asked Nov 21 at 17:22
Rahul Bhaskar
65
Do you realize that it is a pointer to a function? If not, that's what it is. You can now search for the ins and outs of pointers to functions. If you know it's a pointer to a function, what's the problem? It is presumably used to ensure that elements in the BST are in the correct order — it compares two nodes given pointers to the nodes, identifying which comes first and which comes second, or that they're equal.
– Jonathan Leffler
Nov 21 at 17:25
Get a good book or find a good tutorial, one that explains function pointers.
– Some programmer dude
Nov 21 at 17:25
By the way, considering that you should not castmallocin C, the code you found might not be the best to learn from.
– Some programmer dude
Nov 21 at 17:26
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I can't understand the argument, i've seen it for the 1st time.
below is the structure:
typedef struct node{
void* dataPtr;
struct node* left;
struct node* right;
}NODE;
typedef struct{
int count;
int (*compare)(void* argu1, void* argu2);
NODE* root;
}BST_TREE;
This is Prototype:
BST_TREE* BST_Create(int (*compare)(void* argu1, void* argu2));
This is Function:
BST_TREE* BST_Create(int (*compare)(void* argu1, void *argu2)){
BST_TREE* tree;
tree = (BST_TREE*)malloc(sizeof(BST_TREE));
if(tree){
tree->root = NULL;
tree->count = 0;
tree->compare = compare;
}
return tree;
}
c
asked Nov 21 at 17:22
Rahul Bhaskar
65
I can't understand the argument, i've seen it for the 1st time.
below is the structure:
typedef struct node{
void* dataPtr;
struct node* left;
struct node* right;
}NODE;
typedef struct{
int count;
int (*compare)(void* argu1, void* argu2);
NODE* root;
}BST_TREE;
This is Prototype:
BST_TREE* BST_Create(int (*compare)(void* argu1, void* argu2));
This is Function:
BST_TREE* BST_Create(int (*compare)(void* argu1, void *argu2)){
BST_TREE* tree;
tree = (BST_TREE*)malloc(sizeof(BST_TREE));
if(tree){
tree->root = NULL;
tree->count = 0;
tree->compare = compare;
}
return tree;
}
c
c
asked Nov 21 at 17:22
Rahul Bhaskar
65
asked Nov 21 at 17:22
Rahul Bhaskar
65
asked Nov 21 at 17:22
Rahul Bhaskar
65
asked Nov 21 at 17:22
Rahul Bhaskar
65
asked Nov 21 at 17:22
Rahul Bhaskar
65
65
Do you realize that it is a pointer to a function? If not, that's what it is. You can now search for the ins and outs of pointers to functions. If you know it's a pointer to a function, what's the problem? It is presumably used to ensure that elements in the BST are in the correct order — it compares two nodes given pointers to the nodes, identifying which comes first and which comes second, or that they're equal.
– Jonathan Leffler
Nov 21 at 17:25
Get a good book or find a good tutorial, one that explains function pointers.
– Some programmer dude
Nov 21 at 17:25
By the way, considering that you should not castmallocin C, the code you found might not be the best to learn from.
– Some programmer dude
Nov 21 at 17:26
add a comment |
Do you realize that it is a pointer to a function? If not, that's what it is. You can now search for the ins and outs of pointers to functions. If you know it's a pointer to a function, what's the problem? It is presumably used to ensure that elements in the BST are in the correct order — it compares two nodes given pointers to the nodes, identifying which comes first and which comes second, or that they're equal.
– Jonathan Leffler
Nov 21 at 17:25
Get a good book or find a good tutorial, one that explains function pointers.
– Some programmer dude
Nov 21 at 17:25
By the way, considering that you should not castmallocin C, the code you found might not be the best to learn from.
– Some programmer dude
Nov 21 at 17:26
Do you realize that it is a pointer to a function? If not, that's what it is. You can now search for the ins and outs of pointers to functions. If you know it's a pointer to a function, what's the problem? It is presumably used to ensure that elements in the BST are in the correct order — it compares two nodes given pointers to the nodes, identifying which comes first and which comes second, or that they're equal.
– Jonathan Leffler
Nov 21 at 17:25
Do you realize that it is a pointer to a function? If not, that's what it is. You can now search for the ins and outs of pointers to functions. If you know it's a pointer to a function, what's the problem? It is presumably used to ensure that elements in the BST are in the correct order — it compares two nodes given pointers to the nodes, identifying which comes first and which comes second, or that they're equal.
– Jonathan Leffler
Nov 21 at 17:25
Get a good book or find a good tutorial, one that explains function pointers.
– Some programmer dude
Nov 21 at 17:25
Get a good book or find a good tutorial, one that explains function pointers.
– Some programmer dude
Nov 21 at 17:25
By the way, considering that you should not cast
malloc in C, the code you found might not be the best to learn from.– Some programmer dude
Nov 21 at 17:26
By the way, considering that you should not cast
malloc in C, the code you found might not be the best to learn from.– Some programmer dude
Nov 21 at 17:26
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53417529%2fexplain-this-bst-tree-bst-createint-comparevoid-argu1-void-argu2%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Do you realize that it is a pointer to a function? If not, that's what it is. You can now search for the ins and outs of pointers to functions. If you know it's a pointer to a function, what's the problem? It is presumably used to ensure that elements in the BST are in the correct order — it compares two nodes given pointers to the nodes, identifying which comes first and which comes second, or that they're equal.
– Jonathan Leffler
Nov 21 at 17:25
Get a good book or find a good tutorial, one that explains function pointers.
– Some programmer dude
Nov 21 at 17:25
By the way, considering that you should not cast
mallocin C, the code you found might not be the best to learn from.– Some programmer dude
Nov 21 at 17:26