Data Str & Algorithm HW Solutions 84

Data Str & Algorithm HW Solutions 84 - 84 Chap. 13...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
84 Chap. 13 Advanced Tree Structures temp = temp->left; currlev--; } } } 13.4 void Trie::removehelp(TrieNode*& rt, int val, int level) { if (rt == NULL) cout << val << " is not in the tree.\n"; else if (rt->value == val) { TrieNode* temp = rt; rt == NULL delete temp; } else if (bit(val, level) == 0) // Check left removehelp(rt->left, val, level); else // Check right removehelp(rt->right, val);
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/27/2011 for the course MAP 2302 taught by Professor Bell,d during the Fall '08 term at UNF.

Ask a homework question - tutors are online