#Help understanding and solving

5 messages · Page 1 of 1 (latest)

flat tinsel
#

"Have an option that would write the contents of the tree to a file, inorder, then read it back in to balance the tree (use the algorithm in chapter 16). Remember that the algorithm works mainly with a full tree. A full tree has the number of nodes of 2h – 1. Try and get the tree to have that number. Then write and read the tree (count the dummy nodes). Remove the dummy nodes."

This is our homework question and I'm having trouble understanding how we would implement this. Even pseudocode or explanation would help for this

amber relicBOT
#

When your question is answered use !solved to mark the question as resolved.

Remember to ask specific questions, provide necessary details, and reduce your question to its simplest form. For tips on how to ask a good question run !howto ask.

brittle crescent
#

hi! which textbook are you using?

#

i will see if i can help. NOTE: i will only provide pseudocode that is at a high level since this is homework

amber relicBOT
#

This question thread is being automatically closed. If your question is not answered feel free to bump the post or re-ask. Take a look at !howto ask for tips on improving your question.