Search results

Index handler
...h>\mathcal{V}</math>. An object of an implementation of this abstract data structure is repesented by: # A positive integral number <math>N</math>.

2 KB (283 words) - 11:02, 7 November 2014
Binary search tree
[[Category:Data Structures]] ''' Abstract data structure:'''

2 KB (353 words) - 06:14, 6 July 2015
Union-find with lists
'''Abstract Data Structure:''' [[Union-find]] '''Implementation Invariant:'''

3 KB (419 words) - 14:27, 20 June 2015
Heap as array: extract minimum
[[Category:Method of an implementation of a data structure]] '''Type of algorithm:''' loop

3 KB (438 words) - 23:13, 19 June 2015
Heap as array: insert
[[Category: Method of an implementation of a data structure]] '''Type of algorithm:''' loop

3 KB (477 words) - 23:13, 19 June 2015
Heap as array: decrease key
[[Category: Method of an implementation of a data structure]] '''Type of algorithm:''' loop

2 KB (369 words) - 23:12, 19 June 2015
Heap as array: ascendItem
[[Category:Method of an implementation of a data structure]] '''Type of algorithm:''' loop

3 KB (584 words) - 23:12, 19 June 2015
Heap as array: descendItem
[[Category:Method of an implementation of a data structure]] '''Type of algorithm:''' loop

4 KB (635 words) - 23:12, 19 June 2015

Navigation menu