Computer Science

Lookup: Data Structures Implementing Filter Data Structure Operation Profile topics

Share This

Lookup

This is a detail view of Data Structure Operation Profile topics from the Freebase topic about Lookup. This summary is community-built, so if you think there is something missing, just add it!
Learn more about Lookup »
+

x

Add another type with the property you want to view.
Red-black tree

Red-black tree

A red-black tree is a type of self-balancing binary search tree, a data structure used in computing science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer : who called them "symmetric...

Time complexity:

Trie

Trie

In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node;...

Time complexity:

Linked list

Linked list

In computer science, a linked list is a data structure that consists of a sequence of data records such that in each record there is a field that contains a reference (i.e., a link) to the next record in the sequence. Linked lists are among the...

Time complexity:

Showing 1 - 3 prev next
Edit Collection Schema
All topics in this collection are typed as Data Structure Operation Profile
Use Data from this Collection
Choose a format:

Images and articles are not included in export files, which are limited to 1000 items. Complete data dumps are also available here.

Flag this Collection
Why do you want to flag this collection?