Purchase Solution

Build and show a binary tree based on the following names

Not what you're looking for?

Ask Custom Question

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)?

Purchase this Solution
Solution Summary

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

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 ...

Purchase this Solution
Free BrainMass Quizzes
C++ Operators

This quiz tests a student's knowledge about C++ operators.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

Basic Networking Questions

This quiz consists of some basic networking questions.

Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

View More Free Quizzes
Related BrainMass Solutions

  • Binary Trees: Family tree of two generations

    129367 Binary Trees: Family Tree of Two Generations Create a program that uses the structure of binary trees to make a family tree of two generations. The user should input the names when asked, and then the program should display the names.

  • C++ ordered binary tree: inorder, preorder, postorder

    535630 Write a C++ program to read in a set of numbers from an input file and build an ordered binary tree. For this tree, compute and print the following.

  • Problems about binary search tree in Java

    public boolean isBinarySearchTree() // post: returns true iff this is a binary search tree Answer: Based on the binary search tree's property: "for each node, the value of its left child (if any) is < the node value, and the value of its right

  • Determining Root-to-Leaf paths equaling the given sum

    510301 Given a binary tree and a sum, write a C++ program to determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

  • Implementing Operations on Binary Trees

    450363 Implementing Operations on Binary Trees Consider the following definition of a Binary Tree structure: typedef struct BTnode *node; struct BTnode { int key; node left; node right; }; 1.

  • ADT table in Java

    6553 ADT table in Java Question: (a) Based on the following scenario, describe one advantage and one disadvantage of each implementation of the ADT Table (using a binary search tree, ordered vector, or unordered vector).

  • Binary tree proof

    Use induction to show that the number of nodes in a binary tree is equal to one more than the sum of the degrees of the nodes in a binary tree. Proof: We use induction for the number of nodes n in a binary tree.

  • Data Structure Elements

    a complete or full binary tree.

  • Java program to parse an arithmetic expression

    566292 Java program to parse an arithmetic expression Write a Java program that takes as input an infix arithmetic expression then transforms it to a postfix expression and based on a binary tree, it evaluates that expression.

View More Related Solutions