| Welcome to UCR CS 14 Klefstad. You're currently viewing our forum as a guest. This means you are limited to certain areas of the board and there are some features you can't use. If you join our community, you'll be able to access member-only sections, and use many member-only features such as customizing your profile, sending personal messages, and voting in polls. Registration is simple, fast, and completely free. Join our community! If you're already a member please log in to your account to access all of our features: |
| Remove | |
|---|---|
| Tweet Topic Started: Feb 21 2014, 05:45 PM (59 Views) | |
| gchak001 | Feb 21 2014, 05:45 PM Post #1 |
|
What is TreeNode::remove supposed to return? I know that it returns a pointer to a TreeNode, but what is it exactly? |
![]() |
|
| jjime022 | Feb 21 2014, 07:00 PM Post #2 |
|
You'll return the root of the binary tree since you passed it in. Be careful not to return root if you've deleted it. |
![]() |
|
| gchak001 | Feb 21 2014, 07:18 PM Post #3 |
|
Are we still supposed to implement the remove function using recursion even though it might blow the stack when called on Words.txt? |
![]() |
|
| 1 user reading this topic (1 Guest and 0 Anonymous) | |
| « Previous Topic · Homework 6 · Next Topic » |






12:15 PM Jul 11