מבני נתונים ואלגוריתמים - מחברת קורס/מבני נתונים/מחסניות

# Pushes (inserts) a value (v) to a stack (stk).
Push(stk, v)	
 
# Pops (removes) from a stack (stk) the newest value Push()ed 
#	(that has not yet been Pop()ed).
Pop(stk)
 
# Returns the newest value Push()ed to a stack (stk) 
# 	(that has not yet been Pop()ed).
Top(stk)
 
# Returns the number of values inside a stack (stk).
Size(stk)

1	Push(stk, 1)
2	Push(stk, 3)
3	Push(stk, 2)
 
	# Prints 3
4	print Size(stk)
 
	# Prints 2
5	Print Top(stk)
 
6	Pop(stk)
 
	# Prints 2
7	print Size(stk)
 
	# Prints 3
8	Print Top(stk)

# An array-based stack.
Stack
	# An array storing the values.
1	Values
	# The current used size.
2	size
 
 
# Creates a stack.
Make-Stack()
1	stk = Stack()
 
# Note we're using the global variable max-size.
2	stk.Values = Make-Array(max-size)
3	stk.size = 0
 
4	return stk
 
 
# Pushes (inserts) a value (v) to a stack (stk).
Push(stk, v)	
1	stk.Values[++stk.size] = v
 
 
# Pops (removes) from a stack (stk) the newest value Push()ed 
#	(that has not yet been Pop()ed).
Pop(stk)
1	return stk.Values[stk.size--]
 
 
# Returns the newest value Push()ed to a stack (stk) 
# 	(that has not yet been Pop()ed).
Top(stk)
1	return stk.Values[stk.size]
 
 
# Returns the number of values inside a stack (stk).
Size(stk)
1	return stk.size