void instert(NODE**root, int value) { ... insert(&(*root)->left,value); ... } void search(NODE*root, int value) { ... search(root->left, v
The expression:
*root->left
Is equivalent to:
*(root->left)
Due to operator precedence.
So you need:
(*root)->left
If you want the left member that *root points to.
left
*root
And then:
&(*root)->left
Is the pointer to the left member of *root, which is then of type NODE **, what the insert function requires.
NODE **
insert