Data Types
Size is 2 bytes
What is the size of an Int?
LIFO
What is the operating principle of a stack?
FIFO
What is the operating principle of a queue?
Garbage collector
Who cleans an object that is no longer accessible?
Left - Root - Right
What is the order of visiting nodes using an Inorder traversal?
The size of the arrays is fixed, Linked Lists are Dynamic in size.
How is an array different from a LinkedList?
Returns a reference to the top element of the stack
What does peek() do?
An element with high priority is served before an element with low priority.
What is the operating principle of a priority queue?
Consists of n linked lists – The i th linked list has a list entry for vertex j iff the graph contains an arc from vertex i to vertex j
What is an adjacency list?
The inorder traversal is sorted.
How do we know if a Binary Tree is BST?
Check for balanced parentheses in an expression
What is one example for an application of a Stack?
An algorithm for traversing a graph, which starts at the a vertex and explores as far as possible along each edge before backtracking.
What is DFS?
O(1)
What is the time complexity of enQueue(), deQueue() operations in a queue implemented using a circular array?
An object that provides a means of processing a collection of objects, one at a time.
What is an Iterator?
A tree in which every node other than the leaves has two children.
What is a full tree?
The number of entries N in table divided by the table capacity M
What is the load factor of a hash table?
An array of Objects called items, an int named count, and a constant int.
What are the instance variables of ArrayStack?
Separate queues are created for each possible value of each digit or character of the sort key
How is Radix Sort implemented?
An object that contains a reference to data stored in the object, and references for two other similar objects.
What is a BinaryTreeNode?
A binary tree in which the value of each node is greater than or equal to the value of its parent.
What is a MinHeap?