Copy A-D to your Solution file and remember to answer all questions A. Write your name. B. Write code oriented pseudo-code or a C++ function that given a binary tree of stacks, deletes an element from the stack and places it into a dynamically allocated array based on the right-root-left order of the binary tree. Assume the following: • Each node in the binary tree has a pointer to a stack object. Each stack contains at least one element, a pointer to a Data object. • The last element in the array is to be a sentinel value that will be set to NULL. To complete this task call stack ADT functions. C. Give an example that could be used to test this algorithm. Show what is given and what is returned. D. List any assumptions used in your design.

Copy A-D to your Solution file and remember to answer all questions A. Write your name. B. Write code oriented pseudo-code or a C++ function that given a binary tree of stacks, deletes an element from the stack and places it into a dynamically allocated array based on the right-root-left order of the binary tree. Assume the following: • Each node in the binary tree has a pointer to a stack object. Each stack contains at least one element, a pointer to a Data object. • The last element in the array is to be a sentinel value that will be set to NULL. To complete this task call stack ADT functions. C. Give an example that could be used to test this algorithm. Show what is given and what is returned. D. List any assumptions used in your design.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Use C++ to Solve This. 4: Write a program for Queue operation. The program must display the address of element being Pushed or Popped after every Push and Pop operation.
How would you design a stack which, in addition to push and pop, also has a function min which returns the minimum element? Push, pop and min should all operate in O(1) time. Your design (in pseudo code) should include a class Stack and three functions, i.e., push, pop, and min.
Answer the following in data structure A. Write a program to insert data into a Binary Search Tree (BST). B. Write functions for two primary operations in the stack Push ( ) and Pop ( ). C. Write a function to search data in a binary tree. D. Write a function to find minimum value in a binary search tree.
Q#1: The algorithm Enqueue may fails even though there is memory space available. One way to avoid this problem is to rewrite the algorithm Enqueue and Dequeue. Suggestion 1: Rewrite the program Enqueue in C++ using Arrays Whenever the rare pointer gets to the end of the queue, test whether the pointer FRONT is at location 1 or not; if not, shift all the elements so that they are wrapped from the beginning and thus make room for new item. Suggestion 2: Rewrite the program Dequeue in C++ using Arrays After the end of each deletion, all the elements at the trail and shifted once towards the front; here the idea is to fix the FRONT pointer always at 1. The queue which follows such operations is termed as dynamic queue. Rewrite operations ENQUEUE and DEQUEUE for a dynamic queue.
5. The creeping problem occurs when a queue is implemented as an array. (a) Define the creeping problem. (b) Describe how to implement a queue as an array in order to avoid the creeping problem. (c) Write the C++ method Join for the new type of Queue described in (b) above.
Write a C code that will search an int type target from a dynamic linked list. The linked list contains int type values inside each of the nodes. The “search” function will use following input-output arguments,Input: Pointer to the head of the list that you are searching Target value that you are searchingOutput: Pointer to the node that contains the target if found or, NULL if not found.
1 Write a C++ code using a while statement to compute the average of all alternative nodes (1st, 3rd, 5th ...) in the given linked list where the first node is pointed to by first. NOTE: Each node has data member that stores the data and the next member that stores the address of the next node. ( means; there are any number of nodes) Use the following declaration: first Node* next; struct Node { }; int data; double total = double average; Node* temp = first; int count 0; = 0;
need parts a and b using C programing language
1-) Write a function that swaps the contents of a stack and a queue. That is, the function takes the contents of 'stack' and places it in "queue' and the contents of "queue' into 'stack. You may use the stack and queue functions given in the class. Bir kuyruk ile bir stack'in içeriğini yer değiştiren bir fonksiyon yazınız. Sınmfta yazılan kuyruk ve stack fonksyionlarını kullanabilirsiniz. void swapQueueAndStack ( queue *q, stack *s)
I need help with coding in C++ please: Write a program (in main.cpp) to do the following: a. Build a binary search tree T1. b. Do a postorder traversal of T1 and, while doing the postorder traversal, insert the nodes into a second binary search tree T2 . c. Do a preorder traversal of T2 and, while doing the preorder traversal, insert the node into a third binary search tree T3. d. Do an inorder traversal of T3. e. Output the heights and the number of leaves in each of the three binary search trees. The program should accept input and produce output similar to the example below: Enter numbers ending with -999: 10 5 7 -999 tree1 nodes in postorder: 7 5 10 tree2 nodes in preorder: 7 5 10 tree3 nodes in inorder: 5 7 10 tree1 height: 3 tree1 leaves: 1 tree2 height: 2 tree2 leaves: 2 tree3 height: 2 tree3 leaves: 2 The program has 3 tabs: main.cpp , binarysearchTree.h , and binaryTree.h