User Index Page for "data structures"

(Articles 1-10 of 13)
Bookmark and Share
My Articles  |  Articles I Maybe Interested In  |  My Clusters  |  New User? Sign Up  |  Sign In
Custom Search

Map Data Structure

... In the sequential SIMPDEL model, map data are stored as a series of grids, represented as two or three-dimensional arrays, depending on the grid cell resolution, as explained in Section 2.2. To facilitate dynamic grid repartitioning, to be explained in Section 3.1.2, a more efficient data structure is required. The map data structure used in the parallel model is shown in Figure 6. ... [full article] (25 views)
This bookmark is tagged as: map data structure | data structures
Thank you mf for bookmarking this article!

Stack (data structure)

... In computer science, a stack is a last in, first out (LIFO) abstract data type and data structure. A stack can have any abstract data type as an element, but is characterized by only two fundamental operations: push and pop. The push operation adds to the top of the list, hiding any items already on the stack, or initializing the stack if it is empty. The pop operation removes an item from the top of the list, and returns this value to the caller. A pop either reveals previously concealed items, or results in an empty list. ... [full article] (45 views)
This bookmark is tagged as: stack | computer science | data structures
Thank you mf for bookmarking this article!

Suffix tree

... In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many important string operations. ... [full article] (38 views)
This bookmark is tagged as: suffix trees | tree data structures | data structures | string search
Thank you mf for bookmarking this article!

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. ... [full article] (39 views)
This bookmark is tagged as: linked list | data structures | linked list types
Thank you mf for bookmarking this article!

Heap (data structure)

... In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if B is a child node of A, then key(A) ≥ key(B). This implies that an element with the greatest key is always in the root node, and so such a heap is sometimes called a max-heap. (Alternatively, if the comparison is reversed, the smallest element is always in the root node, which results in a min-heap.) The several variants of heaps are the prototypical most efficient implementations of the ... [full article] (24 views)
This bookmark is tagged as: heap data structure | data structures
Thank you mf for bookmarking this article!

Binary tree

... In computer science, a binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as \"left\" and \"right\". Nodes with children are parent nodes, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the \"root\" node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left or right child. ... [full article] (25 views)
This bookmark is tagged as: tree data structure | binary tree | data structures
Thank you mf for bookmarking this article!

Tree (data structure)

... A Tree structure is a way of representing the hierarchical nature of a structure in a graphical form. In computer science, a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes. ... [full article] (25 views)
This bookmark is tagged as: tree data structure | data structures | ordered tree data structure
Thank you mf for bookmarking this article!

Binary search tree

... In computer science, a binary search tree (BST) or ordered binary tree is a node-based binary tree data structure which has the following properties:[1] ... [full article] (27 views)
This bookmark is tagged as: binary search tree | BST | tree structures | data structures
Thank you mf for bookmarking this article!

Hash table

... In computer science, a hash table or hash map is a data structure that uses a hash function to map identifying values, known as keys, (e.g., a person\'s name) to their associated values (e.g., their telephone number). The hash function is used to transform the key into the index (the hash) of an array element (the slot or bucket) where the corresponding value is to be sought. ... [full article] (26 views)
This bookmark is tagged as: hash table | data structures | hash map
Thank you mf for bookmarking this article!

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; instead, its position in the tree shows what key it is associated with. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string. Values are normally not associated ... [full article] (26 views)
This bookmark is tagged as: trie | computer science | data structures
Thank you mf for bookmarking this article!
  1. 1
  2. 2

New to WEBYAM...

  • With WEBYAM you can carry your bookmarks wherever you go
  • With WEBYAM bookmark something that you want the world to know
  • In WEBYAM search for any information and get relevant links posted by real people

What to add?

Any article (it can be news, opinions, reviews ...) on the web that you find good or useful and want to share with everyone. Add the title of the article, few lines (snippet) from the article, and the article's URL.  add now  more help...

Follow webyam on...

What is Cluster?

Cluster is the best way to organize your web. Give a title, a short description and select the tags you want to track in that cluster and your own cluster will be ready to use.  create now  more help...