Given the following list of data structures, classify each as being either an abstract data type or basic data type. Recall that an abstract data type can change the implementation without changing the interface. Use the space below the table to explain your answers. Answers with good explanations may convince the grader that a wrong answer is \"correct\".
Solution
Basic Data type:
Array, Heap and BinaryTree
Reason:
They are collection of data items with similar datatype. But they have no
default methods to access the elements. So they are said to be basic data types.
ADT:
Stack, Queue, Vector, PriorityQueue,LinkedList,Heap, BinaryTree
Reason: ADT is the one which has members as well as member functions to access those members.
Stack: push(), pop()
queue: enqueue(), dequeue()
Vector:push_back(),get()
LinkedList: insert(), delete()
.
Given the following list of data structures- classify each as being ei.docx
1. Given the following list of data structures, classify each as being either an abstract data type or
basic data type. Recall that an abstract data type can change the implementation without
changing the interface. Use the space below the table to explain your answers. Answers with
good explanations may convince the grader that a wrong answer is "correct".
Solution
Basic Data type:
Array, Heap and BinaryTree
Reason:
They are collection of data items with similar datatype. But they have no
default methods to access the elements. So they are said to be basic data types.
ADT:
Stack, Queue, Vector, PriorityQueue,LinkedList,Heap, BinaryTree
Reason: ADT is the one which has members as well as member functions to access those
members.
Stack: push(), pop()
queue: enqueue(), dequeue()
Vector:push_back(),get()
LinkedList: insert(), delete()
