Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
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.
I am working on a Binary search tree.
So,here is the structure used for representing the node:
typedef struct TreeNode
{
int num;
struct TreeNode *left,*right;
}TREENODE;
To insert a node in the tree I have the following method signatire
void InsertNode(TREENODE **root,int data);
In the above method why do we require double pointer.We can use a single pointer!
Are we using double pointer to avoid duplication?
No, this is needed in case of rebalancing. After rebalancing root could be changed.
Ok, I will expand. Double pointer allows you to modify the pointer. So what is tree root in your case? Pointer to
TREENODE. Some operations like search will never modify it. But some operations might need to change it, so that another node becomes new root. So they have to have access to that variable that you use as root. One example why they might need it is rebalancing, see AVL trees.