ArgumentException
binary search tree
binary tree
binary-tree sort
boxing conversion
child node
circular, doubly linked list
circular, singly linked list
collection
CompareTo method of interface IComparable
CompareTo
IComparable
data structures
dequeue
doubly linked list
duplicate elimination
dynamic data structures
enqueue
first-in, first-out (FIFO) data structure
head of a queue
IComparable interface
inorder traversal
InvalidCastException
last-in, first-out (LIFO) data structure
leaf node
left child node
left subtree
level-order traversal of a binary tree
linear data structure
link
linked list
node
OutOfMemoryException
parent node
pop on a stack
postorder traversal
predicate method
preorder traversal
print spooling
push on a stack
queue
right child node
right subtree
root node
searching
self-referential class
sibling node
simple type
singly linked list
sorting
spooler
stack
struct
tail of a queue
top of a stack
tightly packed binary tree
unboxing conversion
ValueType class
ValueType