Index

A

abstract data type/ADT abstraction access keywords acyclic graph address-of adjacency list adjacency matrix adjacent

algorithm, [1], [2] AND argument array array parameters atomic data type average case AVL tree

B

balance factor balanced parentheses base case base class best case Big-O notation binary heap

binary search binary search tree binary tree bool breadth first search (BFS) brute force bst propery bubble sort

C

chaining char child class children class class methods clustering collection collision

collision resolution compiler complete binary tree computable const constructor contains contiguous cycle cyclic graph

D

data abstraction data structure, [1] data types depth first forest depth first search (DFS) deque dereference

derived class digraph directed acyclic graph (DAG) directed graph double dynamic programming dynamic size

E

edge, [1] edge cost

encapsulation exception exponential

F

first-in first-out (FIFO) float folding method forward list fractal Koch

friend friend function fully parenthesized function function overloading

G

gap

get_item

H

handle an exception HAS-A Relationship hash function hash table, [1], [2]

hashing head heap order property height

I

immutable, [1] immutable data type infinite recursion infix information hiding inheritance

inheritance hierarchy inorder insertion sort instance int int main() interface

K

Koch fractal

L

last-in first-out (LIFO) leaf node level linear linear data structure linear probing

linked data structure linked list linked list traversal list load factor logarithmic

M

machine code map max heap median of three merge

merge sort mid-square method min heap mutability mutable mutable data type

N

node, [1]

NOT

O

object object attribute object-oriented programming language open addressing operator overloading

OR order of magnitude ordered linked list ordered list overloading

P

palindrome parameter parent parent class parenthesis property partition pass by reference pass by value path, [1] perfect hash function

pivot value pointer polymorphism postfix postorder precedence prefix preorder priority queue programming

Q

quadratic quadratic probing

queue quick sort

R

raise recursion recursive call recursive definition

reference rehashing root rotation

S

searching selection sort sequential search set set_item shell sort short bubble shortest path sibling simulation slot

sorting spanning tree split point stack stack frame string strongly connected components (SCC) subclasses subtree successor superclass

T

topological sorting tree

truth table tuple, [1] tuple assignment

U

uncontrolled flooding

unordered linked list unordered set

V

vector, [1] vertex

virtual function void

W

weight

word worst case

You have attempted of activities on this page