Binary search tree insertion - root always null

梦想的初衷 提交于 2019-12-02 02:48:24
Grijesh Chauhan

You are passing root as value so changes made to root in insert function doesn't reflect at main function, hence root remains NULL in main function. To rectify your code, you need to pass Pointer to pointer. Pass address of root to reflect change in main function.

void insertRec(node *r, int num)

should be coded like:

void insertRec(node **r, int num)
{
    if(*r==NULL)
    {      
         *r= malloc(sizeof(node)); 
         (*r)->data=num; 

 // 

and use *root inside insert function.

And call it as insertRec(&root, 10); from main.

Additionally, if you allocates memory dynamically then you should free allocated memory using free explicitly.

One more thing learn Indenting C Programs.

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!