Search results

Heaps
[[Category:Data Structures]]

542 bytes (72 words) - 22:29, 19 September 2014
Hashtable
[[Category:Data Structures]]

666 bytes (89 words) - 22:15, 6 October 2014
Linked list
[[Category:Data Structures]]

242 bytes (34 words) - 22:49, 19 June 2015
Doubly-linked list
[[Category:Data Structures]]

249 bytes (35 words) - 23:08, 19 June 2015
Decision Tree
[[Category:Data Structures]]

109 bytes (11 words) - 17:39, 10 September 2014
Main Page
=== Abstract Data Structures === *[[Network Structures]]

4 KB (380 words) - 15:13, 30 November 2020
Model computer
...e. These details are not necessary for the analysis of algorithms and data structures. All descriptions of algorithms and data structures and algorithmic problems in this wiki shall be based on this model of compu

3 KB (401 words) - 14:28, 13 January 2015
Binary search tree
[[Category:Data Structures]] ''' Abstract data structure:'''

2 KB (353 words) - 06:14, 6 July 2015
Dial implementation
[[Category:Data Structures]] '''Abstract data structure:''' [[Bounded monotonous priority queue]].

2 KB (304 words) - 09:57, 26 February 2015
Heap as array
[[Category:Data Structures]] '''Abstract Data Structure:''' [[Bounded priority queue]]

3 KB (462 words) - 23:12, 19 June 2015
Classical eulerian cycle algorithm
We assume that all data structures are implemented in the obvious appropriate way. First note that steps 1, 2,

4 KB (673 words) - 08:15, 2 November 2015

Navigation menu