Explore BrainMass
Share

Explore BrainMass

    Build and show a binary tree based on the following names

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    The Binary Tree is one of the best ways to organize data when you need fast access. For this assignment, we will organize a list of names and perform various operations on those names. Build and show a binary tree based on the following names inserted into the binary tree in order listed: John, Eddie, Kim, Derrick, Ethan, Lonny, Mark, Curly, Donny, Nancy, Patricia, Oscar.

    Show the order to names for a preorder traversal
    Show the order to names for a postorder traversal
    Show the order to names for a inorder traversal

    Is this tree balanced? Why or why not?

    How would the tree need to look for it to be more balanced if it is not?

    If we deleted Eddie from the tree, what would the new tree look like (use one of the current names to replace Eddie and the tree redone)?

    © BrainMass Inc. brainmass.com October 10, 2019, 3:41 am ad1c9bdddf
    https://brainmass.com/computer-science/trees/building-balancing-binary-tree-430769

    Solution Preview

    ** Please see the attachment for the complete solution response **

    A tree is balanced if its left subtree and right subtree have the same height. From the picture you can see that the left subtree has height 3 and the right subtree has height 6. So it is not ...

    Solution Summary

    This solution shows how to build and balance a binary tree with a given set of names.

    $2.19