Cosc 2P12 Assignment 4 ou will find a MIPS assembly program BinaryTree.asm as downloadable code.

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

I need plagiarism free assignment and all steps followed according to given in the assignment...

 

Cosc 2P12

Assignment 4

 

Part A:

You will find a MIPS assembly program BinaryTree.asm as downloadable code. You can

assemble and run this program. It will prompt you to enter integers until a 0 is entered,

terminating the input. These integers are stored in Input. The call to BuildTree will build a

Binary Search Tree from Input, where Root points to the root node of the tree. Each Node is laid

out in the following format:

A node consumes 12 bytes, i.e. 3 words. The first 2 words hold pointers to other nodes in the tree

while the last word will hold the integer payload. Note: that null is represented as -1 in the nodes,

and non null values are addresses in the heap space. You can inspect the heap and see the

structure of the tree.

Write the procedure InOrder which will traverse the tree yielding an InOrder output of the data

values. This procedure will be recursive and must comply with the standards as taught in class.

Each recursive call will need an activation record. These should be created and destroyed using

the conventions set out in lecture. Following convention is important to show your understanding

of activation records.

Be sure to properly document your code.

Test your solution with multiple inputs. At the very least show that the following input 66 44 75

21 57 79 39 24 will produce an InOrder output.

Submission

This submission will be submitted electronically as a MIPS assembly file.

The TA will be running your program to ensure it is fully functional. Make the marker happy!!!

Left Right Data

For the electronic submission, use Sakai, an assignment 4 submission will be available.

The End 

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of