void inorder(struct node *ptrif(ptr!=nullinorder(ptr -left_child)printf("% ",ptr -val)inorder(ptr -right_child)main(bool ht_incint data int optionstruct node *root (struct node *)malloc(sizeof(struct node))root nullwhile( printf(" insert\ ")printf(" display\ ")printf(" quit\ ")printf("enter your option ")scanf("% ",&option)switch(choicecase printf("enter the value to be inserted ")scanf("% "&data)ifsearch(root,data=null root insert(dataroot&ht_inc)else printf("duplicate value ignored\ ")breakcase if(root==nullprintf("tree is empty\ ")continueprintf("tree is :\ ")display(root )printf("\ \ ")printf("inorder traversal is")inorder(root)printf("\ ")breakcase exit( )defaultprintf("wrong option\ ") red-black trees red-black tree is self-balancing binary search tree that was invented in by rudolf bayer who called it the 'symmetric binary -treealthough red-black tree is complexit has good worst