Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
1. Write a C++ program to create a queue of size n. The value in the middle (MID) position of the queue should be zero, value in the MID+1 position should be 1 and the value in MID-1 position should be fixed to -1.

1. Write a C++ program to create a queue of size n. The value in the middle (MID) position of the queue should be zero, value in the MID+1 position should be 1 and the value in MID-1 position should be fixed to -1.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
I need the answer as soon as possible
1. Write a C++ program to create a queue of size n. The value in the middle (MID) position of the queue should be zero, value in the MID+1 position should be 1 and the value in MID-1 position should be fixed to -1. a. Insert the values and display the contents of the queue by ignoring and considering those fixed values. b. Create a binary tree with root value being the MID position value of the above queue. Then the left child of the root should be the value at MID-2 position of the queue. Similarly, the right child of the root should be the value at last position of the queue. Display the created tree. C. Accept more values from the user and make the above created tree to be the complete binary tree. d. Display the leaf node values and find the sum of internal node values.
Transcribed Image Text:1. Write a C++ program to create a queue of size n. The value in the middle (MID) position of the queue should be zero, value in the MID+1 position should be 1 and the value in MID-1 position should be fixed to -1. a. Insert the values and display the contents of the queue by ignoring and considering those fixed values. b. Create a binary tree with root value being the MID position value of the above queue. Then the left child of the root should be the value at MID-2 position of the queue. Similarly, the right child of the root should be the value at last position of the queue. Display the created tree. C. Accept more values from the user and make the above created tree to be the complete binary tree. d. Display the leaf node values and find the sum of internal node values.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS