0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What does the root word esthes mean?
The root word 'esthes' means 'feel.'
What does the root word leio mean?
The root word 'leio' means 'smooth.'
What does the root word olfact mean?
The root word 'olfact' means 'smell.'
What does the root word malus mean?
The root word 'malus' means 'bad.'
What does the root word lepto mean?
The root word 'lepto' means 'slender.'
What word contains the root word null or nil?
annul. Their marriage was annulled.
What is the Algorithm to count the number of leaf nodes in binary tree?
int countleaves(struct node* root){ if(root!=null) { countleaves(root->left); if(root->left==NULL&&root->right==NULL) { count++; } countleaves(root->right); } }
What does the french word nuls mean in English?
null
What does null mean in facebook message?
its a fake word
What does the root word luster mean?
The root word "luster" means shine or polish. It describes the quality of being shiny or glossy.
What does the root word incred mean?
Incred is not a root word. It is a root with a negating prefix.
Give a recursive version of the tree-insert?
Insert (Node *root, Node *newp) { if (root->left==NULL) { root->left= newp; return; } if (root->right==NULL) { root->right= newp; return; } Insert (root->left, newp); }
What does the root word stat mean?
The root word means to stand. stigma is one word that has this root word.
What does the root word of epiphysis mean?
growth the root word is physis
What does the root word of changeable mean?
able is the root in the word changeable
What is the algorithm to count no of nodes in singly linked list?
int numNodes = 0; Node current = root; // if root is null, the number of nodes is 0 if(current != null) { // if root is not null, we have at least one node numNodes = 1; // count all nodes while(current .next != null) { ++numNodes; current = current.next; } }
Write a C program to delete a tree ie free up its nodes?
void del(int item) { node *parent,*location; if(root==NULL) { cout<<"Tree empty"); return; } find(item,&parent,&location); if(location==NULL) { cout<<"Item not present in tree"; return; } if(location->lchild==NULL && location->rchild==NULL) case_a(parent,location); if(location->lchild!=NULL && location->rchild==NULL) case_b(parent,location); if(location->lchild==NULL && location->rchild!=NULL) case_b(parent,location); if(location->lchild!=NULL && location->rchild!=NULL) case_c(parent,location); free(location); }/*End of del()*/ void find(int item,node **par,node **loc) { node *ptr,*ptrsave; if(root==NULL) /*tree empty*/ { *loc=NULL; *par=NULL; return; } if(item==root->info) /*item is at root*/ { *loc=root; *par=NULL; return; } /*Initialize ptr and ptrsave*/ if(item<root->info) ptr=root->lchild; else ptr=root->rchild; ptrsave=root; while(ptr!=NULL) { if(item==ptr->info) { *loc=ptr; *par=ptrsave; return; } ptrsave=ptr; if(item<ptr->info) ptr=ptr->lchild; else ptr=ptr->rchild; }/*End of while */ *loc=NULL; /*item not found*/ *par=ptrsave; }/*End of find()*/
