| |
| | [No title] |
 | | A) { if((tmp=srch_key(curr->left,key)) != NULL) return tmp; } else if(curr->keys ==1) { if((tmp=srch_key (curr->middle,key)) != NULL) return tmp; } else { if(key |
 | | B) { if((tmp=srch_key(curr->middle,key)) != NULL) return tmp; } else { if((tmp=srch_key(curr->right,key)) != NULL) return tmp; } } return NULL; } //Returns the node or returns nearest leaf node node23 *TREE23::srch_key1 (node23 *curr,int key) { if(curr->type ==LEAF) return curr; if(key |
 | | B) return (srch_key1 (curr->middle,key)); else return (srch_key1 (curr->right,key)); } //Returns empty blank node. |
| vorlon.cwru.edu /~skj/4051/a4.cpp (1014 words) |
|