x. void fred (treeT *tptr, int key) a. { b. treeT t; c. int sign; d. t = *tptr;

Question

x. void fred (treeT *tptr, int key) a. { b. treeT t; c. int sign; d. t = *tptr; e. if (t == NULL { f. t = New(treeT); g. t->key = key; h. t->left = t->right = NULL; m. *tptr = t; n. return; o. } p. if (key < prevkey) r fred(&t-;>left, key); s. else t. fred(&t-;>right, key); w. }

Explanation / Answer

void fred (treeT *tptr, int key) { treeT t; int sign; t = *tptr; if (t == NULL ) { t = New(treeT); t->key = key; t->left = t->right = NULL; *tptr = t; return; o. } if (key left, key); else fred(&t->right, key); } Its binary search function which is using pointer based addressing modes to check the address stored in address pointer t

Related Questions

Navigate

• Browse (All)
• Browse X
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.