Implementable

Implementation independence

Implementing a data abstraction

Implementing recursive programs

Inclusion relationship

increase

Independence

Index

array

cylinder

master

Indexed sequential access

Indexing methods

Indirect recursion

Infix expressions

Infix expressions

Infix expressions

Infix notation

info

info

Information field

Information retrieval

initial

initial

Initialization

initialize

lists

lists

lists

lists

lists

lists

lists

permutations

permutations

Inorder traverse

Input buffer area

Input validation module(topsort)

Input/output

insert

lists

primes

primes

primes

primes

queues

topsort

insertavl

nonrecursive

recursive

insertinorder

Insertion sort

Insertion sort

modified

timing

Insertion

B-tree

balanced binary search tree

binary search tree(simple)

hash table

in binary tree

lists

prime numbers

priority queues

queues

insertionsort

insertnode

interchange

Internal fragmentation

Internal memory

Internal node

Interpolation search

Irreflexivity

ISAM

iszero

item, array implementation

item, array implementation

in binary tree creation

in n-queens

Iterative