ITE6201 Data Structures and Algorithms
In a directed graph, edges are drawn using lines.
false
It removes from the map the entry.
erase(k)
The graphs must be stored in computer memory.
true
It return an iterator to the first entry of M.
begin()
These are used to model electrical circuits, chemical compounds and highway maps.
Graphs
It provides a natural organization for data.
Trees
It returns the parent of the tree.
p.parent()
It is a pair of nodes.
edge of tree
It sorts the list by moving each element to its proper place.
insertion sort
It is consists of two major components: bucket array and a hash function.
hash table
Returns the left child of the p.
p.left()
This graph traversal that traverse a binary tree level-by level.
breadth-first traversal
This graph operation makes the graph empty.
Clear the graph
It is similar to preorder traversal of a binary tree.
depth-first traversal
It returns a position list containing the children of node p.
p.children()
It returns the number of entries in map.
size()
It is a pair sets of vertices that connects through edges.
graph
A tree is either empty or consist of nodes.
TRUE
The list is partitioned and combining the sorted lowerSublist and upperSublist is trivial.
quicksort
It is an abstract data type that stores elements hierarchically.
tree
It is an ordered tree in which every node has at most two children.
binary tree
Merge sort combines the two sorted sublists into one sorted list.
true
It uses divide-and-conquer technique to sort a list by partitioning the list into two sublists.
merge sort
A linear ordering of a tree.
Ordered trees
It is an array of size N where each cell of A is thought of as a bucket
bucket array
Returns the parent of p.
p.parent()
In an undirected graph, edges are drawn using lines.
false
This graph operation stores the graph in computer memory.
create the graph
It return true if p is the root and false otherwise.
p.isRoot()
It returns true if the tree is empty and false otherwise.
empty()
A list is sorted by selecting elements in the list, one at a time, and moving them to their proper positions.
Selection sort
In a tree structure, has a parent element and zero or more children elements.
true
It returns true if map is empty and false otherwise.
empty()
It allows you to store elements so they can be located quickly using keys.
map
It is a node where it stores an element.
root
A binary tree function that removes the last node of the tree and return its element
remove()
It stores elements at the nodes of the tree.
tree
What is the first sublist of the following sets of number
10 18 17 15 21 34 36 32 33 37
[10]
It return an iterator to the first entry of M.
begin
begin()
