Question: 1. Develop a new data structure that can work either as a stack or as a queue. That is, upon instantiation of the object, it

1. Develop a new data structure that can work either as

1. Develop a new data structure that can work either as a stack or as a queue. That is, upon instantiation of the object, it may either use push/pop or insert/remove operations but not both. The data structure should be dynamic and shouldn't be restricted to size limitations. Illustrate your design and provide all necessary definitions for the new object and its operations in Clanguage. (20 pts) root 2. Step-by-step illustrate (draw) how the code fragment below works on the doubly-linked list structure given on the right: DLLNodePtr p = root, tmp; while (p != NULL) if (p->left . NULL) { printf ("%3d", p->info); p. p->right; } else { tmp = p >left; while (tmp->right != NULL && tmp->right != p) tmp = tmp->right; if (tmp->right . NULL) { tmp->right = p; p. p->left; } else { printf ("%3d", p->info); tmp->right = NULL; p. p->right; ) 5 13 11 15 (20 pts) 3. Assume you are given a binary tree structure as below. Develop an algorithm that transforms the structure on the left into a structure on the right. On the given figure, Gr, Par and Ch stands for the Grandparent, Parent and Child nodes. Translate your algorithm into C code. Cir ch Ch Par P R (20 pts) 1. Develop a new data structure that can work either as a stack or as a queue. That is, upon instantiation of the object, it may either use push/pop or insert/remove operations but not both. The data structure should be dynamic and shouldn't be restricted to size limitations. Illustrate your design and provide all necessary definitions for the new object and its operations in Clanguage. (20 pts) root 2. Step-by-step illustrate (draw) how the code fragment below works on the doubly-linked list structure given on the right: DLLNodePtr p = root, tmp; while (p != NULL) if (p->left . NULL) { printf ("%3d", p->info); p. p->right; } else { tmp = p >left; while (tmp->right != NULL && tmp->right != p) tmp = tmp->right; if (tmp->right . NULL) { tmp->right = p; p. p->left; } else { printf ("%3d", p->info); tmp->right = NULL; p. p->right; ) 5 13 11 15 (20 pts) 3. Assume you are given a binary tree structure as below. Develop an algorithm that transforms the structure on the left into a structure on the right. On the given figure, Gr, Par and Ch stands for the Grandparent, Parent and Child nodes. Translate your algorithm into C code. Cir ch Ch Par P R (20 pts)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Q1. Develop a new data structure that can work either as a stack or as a queue. That is, upon instantiation of the object, it may either use push/pop or insert/remove operations but not both. The...

Develop a new data structure that can work either as a stack or as a queue. That is, upon instantiation of the object, it may either use push/pop or insert/remove operations but not both. The data...

Part I - The SimpleMusicTrack class For this assignment you must design a class named SimpleMusicTrack. This class must implement the PlayListTrackinterface given below. You must download this file...

Implement a Queue ADT class that utilizes a circular buffer by completing the provided skeleton code in the file queue_sa.py. You will use the Static Array data structure from previous assignments as...

PYTHON - Please help me with this problem, and please do not just copy code that is from a similar question on chegg or course hero, they do not work! I need help with methods enqueue and dequeue...

Assignment # 5 - Radix Sorting Background: The purpose of this assignment is to get familiar with the deque ( double - ended queue ) node - based structure along with generic data type. In this...

MUST BE DONE IN C++ Hashing is very useful if we are only interested in insert, delete, and find operations; e.g., delete (30) or insert (15) or find (-10). But a hash table provides no assistance...

Need help with CSE 205 Java project Here are the included Java classes Main: mport javax.swing.JFrame; /** * The Main class containing the main() and run() methods. */ public class Main { // A...

There are some inconsistencies in the homework, so let me clarify: Append should operate like insert, and takes an index. AddToEnd() does not need an index. The sample driver is incorrect in calling...

Suppose that, over a period of six months, the price of corn increased. Yet, the quantity of corn sold by producers decreased. Does this contradict the law of supply? If not, why not?

The questions in this exercise are based on JetBlue Airways Corporation. To answer the questions, you will need to download JetBlues Form 10-K/A for the year ended December 31, 2004 at...

Required intormation Problem 1 0 - 5 B ( Static ) Understand stockholders' equity and the statement of stockholders' equity ( LO 1 0 7 ) [ The following information applies to the questions displayed...

Sanders, Inc. reports the following information (assume no beginning inventory): What is the unit product cost using absorption costing? A. $66 B. $73 C. $65 D. $74

What are ( a ) preferred provider organizations and ( b ) health maintenance organizations? In your answer, explain how each is designed to alleviate the overconsumption of health care.

What major criticisms of the U.S. welfare system led to its reform in 1996 (via the Personal Responsibility Act)? How did this reform try to address those criticisms? Do you agree with the general...

What are the implications of rapidly rising health care prices and spending for ( a ) the growth of real-wage rates, ( b ) government budgets, and ( c ) off shoring of U.S. jobs? Explain.