What an instance of the data structure looks like(e.g. how a heap is organized) 

What are the rules/properties for that data structure (e.g. the properties that describe a valid heap)

The main operations that are applied to that data structure, as part of the interface(e.g. "insert" and "deleteMax" are the primary operations of a priority queue)

A typical implementation of these operations

The runtime requirements of the operatiosn applied to that data structure(e.g. "deleteMax" on a priority queue takes O(log n) time)

Given an example data structure (with actual data), show the results of applying a particular operations on that data (e.g.show the result of inserting a new element in a heap)

Answer rating: 100% (QA)

Lets consider a binary search tree BST as an example data structure 1 Instance of the Data Structure A binary search tree is a hierarchical data struc... View the full answer