Purchase Solution

Three questions about binary tree and heap

Not what you're looking for?

Ask Custom Question

I need help with the following in order to study for my test. The last time you were able to explain the lists so that I did well so I hope to be able to get the same results.

1.Show the order in which the nodes in the tree, which I included in the attachment are processed by
a. an inorder traversal of the tree.
b. a postorder traversal of the tree.
c. a preorder traversal of the tree.

2.A priority queue of strings is implemented using a heap. The heap contains the
following elements:
numElements [10]
.elements
[0]"introspective"
[1 ]"intelligent"
[2]"intellectual"
[3]"intimate"
[4]"intensive"
[5]"interesting"
[6]"internal"
[7]"into"
[8]"in"
[9]"intro"
a. What feature of these strings is used to determine their priority in the priority
queue?
b. Show how this priority queue is affected by adding the string "interviewing."

3.This is the specification of the directed graph
ZooGraph = (V, E)
V(ZooGraph) = {dog, cat, animal, vertebrate, oyster, shellfish, invertebrate, crab,
poodle, monkey, banana, dalmatian, dachshund}
E(ZooGraph) = {(vertebrate, animal), (invertebrate, animal), (dog, vertebrate),
(cat, vertebrate), (monkey, vertebrate), (shellfish, invertebrate),
(crab, shellfish), (oyster, shellfish), (poodle, dog), (dalmatian,
dog), (dachshund, dog)}
To tell if one element in ZooGraph has relation X to another element, you look
for a path between them. Show whether the following statements are true, using
the picture or adjacency matrix.
a. dalmatian X dog
b. dalmatian X vertebrate
c. dalmatian X poodle
d. banana X invertebrate
e. oyster X invertebrate
f. monkey X invertebrate

Attachments
Purchase this Solution
Solution Summary

The solution gives detailed steps on answering 3 questions regarding binary tree and heap.

Solution Preview

1
A. inorder traversal (we start from left then root then right)
11 22 23 29 30 47 49 56 59 61 62 64 69

B. postorder traversal (we start from left then right then root)
11 23 30 29 22 49 47 61 64 62 59 69 56

C. pre order traversal (we start from root then left then right)
56 47 22 11 29 23 30 49 69 59 62 61 64

2
A. The feature is that length of the string is used to determine their priority in the priority ...

Purchase this Solution
Free BrainMass Quizzes
Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

C# variables and classes

This quiz contains questions about C# classes and variables.

Basic Networking Questions

This quiz consists of some basic networking questions.

Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

Excel Introductory Quiz

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

View More Free Quizzes
Related BrainMass Solutions

  • Merging Sorted Lists Using Heaps

    For definiteness, let us use a Min-Heap. We need here to recall only the following 3 properties of heaps: - A Heap is a nearly complete binary tree and, given k items, they can be arranged into a Heap in a O(k log k ) time.

  • Design and Analysis of Algorithms

    Creating a heap in an array is simulating a binary tree on top of the array.

  • heap structure

    (The structure of this heap is described at Binary heap: Heap implementation.) Heapsort makes use of two standard heap operations: insertion and root deletion.

  • Write a C++ program to take n elements and insert them into a heap

    578683 Binary tree and Heap programs I need help with this assignment for my discussion forum. It says to write a program to take n elements and insert them into a heap one by one. Include a function to print out the elements in the heap.

  • ADT table in Java

    A problem about ADT table in Java Posting 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).

  • Problems about binary search tree in Java

    6578 Problems about binary search tree in Java Questions: a. Consider the following binary search tree: (Please see the figure in attached problem file) i. What tree results after you insert the nodes 44, 48, 32, 36, 38, and 49 in that order?

  • C++ program to determine structurally identical binary trees

    Not Equal Comparing tree#1 and tree#3 ... Equal Comparing tree#1 and tree#4 ... Not Equal Comparing tree#2 and tree#3 ... Not Equal Comparing tree#2 and tree#4 ... Equal Comparing tree#3 and tree#4 ...

  • Binary tree proof

    28277 Binary Tree Induction # Recall that a binary tree can be defined recursively as: * A Binary Tree is either empty * or A Binary Tree consists of a node with a left and right child both of which are Binary Trees.

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

View More Related Solutions