Write a program in C++ for binary tree that implement following methods: Create(P, X) : P is location of parent of node which is to be created, X is either Left or Right. Delete(N): N is location of node which is to be deleted. If the node to be deleted is an internal node, fill the space vacated by deleted node by moving the last node (rightmost node at the last level) to the vacant space. Display() : display the entire binary tree (information and location of each node, location of its left and right children) Search(v): v is some value, search all node(s) n having value equal to v and print the location of those node(s). Also print the location of parent of those node(s). Also, implement the inorder, preorder and postorder traversal of binary tree. Your program should implement two classes. One class should use sequential representation. Second class should use linked representation using arrays.

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
icon
Related questions
Question
I need the answer as soon as possible
Write a program in C++ for binary tree that
implement following methods:
Create(P, X) : P is location of parent of node
which is to be created, X is either Left or Right.
Delete(N): N is location of node which is to be
deleted. If the node to be deleted is an internal
node, fill the space vacated by deleted node by
moving the last node (rightmost node at the last
level) to the vacant space.
Display() : display the entire binary tree
(information and location of each node, location
of its left and right children)
Search(v): v is some value, search all node(s) n
having value equal to v and print the location of
those node(s). Also print the location of parent
of those node(s).
Also, implement the inorder, preorder and
postorder traversal of binary tree.
Your program should implement two classes.
One class should use sequential representation.
Second class should use linked representation
using arrays.
Transcribed Image Text:Write a program in C++ for binary tree that implement following methods: Create(P, X) : P is location of parent of node which is to be created, X is either Left or Right. Delete(N): N is location of node which is to be deleted. If the node to be deleted is an internal node, fill the space vacated by deleted node by moving the last node (rightmost node at the last level) to the vacant space. Display() : display the entire binary tree (information and location of each node, location of its left and right children) Search(v): v is some value, search all node(s) n having value equal to v and print the location of those node(s). Also print the location of parent of those node(s). Also, implement the inorder, preorder and postorder traversal of binary tree. Your program should implement two classes. One class should use sequential representation. Second class should use linked representation using arrays.
Expert Solution
steps

Step by step

Solved in 2 steps with 10 images

Blurred answer
Knowledge Booster
Types of trees
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education