Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 6e897a0

Browse files
committed
Minor README updates.
1 parent b73aa7f commit 6e897a0

File tree

14 files changed

+17
-17
lines changed

14 files changed

+17
-17
lines changed

‎src/data-structures/bloom-filter/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Bloom Filter
22

3-
A bloom filter is a space-efficient probabilistic
3+
A **bloom filter** is a space-efficient probabilistic
44
data structure designed to test whether an element
55
is present in a set. It is designed to be blazingly
66
fast and use minimal memory at the cost of potential

‎src/data-structures/graph/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Graph
22

3-
In computer science, a graph is an abstract data type
3+
In computer science, a **graph** is an abstract data type
44
that is meant to implement the undirected graph and
55
directed graph concepts from mathematics, specifically
66
the field of graph theory

‎src/data-structures/hash-table/README.md‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
# Hash Table
22

3-
In computing, a hash table (hash map) is a data
4-
structure which implements an associative array
5-
abstract data type, a structure that can map keys
6-
to values. A hash table uses a hash function to
3+
In computing, a **hash table** (hash map) is a data
4+
structure which implements an *associative array*
5+
abstract data type, a structure that can *map keys
6+
to values*. A hash table uses a *hash function* to
77
compute an index into an array of buckets or slots,
88
from which the desired value can be found
99

‎src/data-structures/heap/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Heap (data-structure)
22

3-
In computer science, a heap is a specialized tree-based
3+
In computer science, a **heap** is a specialized tree-based
44
data structure that satisfies the heap property described
55
below.
66

‎src/data-structures/linked-list/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Linked List
22

3-
In computer science, a linked list is a linear collection
3+
In computer science, a **linked list** is a linear collection
44
of data elements, in which linear order is not given by
55
their physical placement in memory. Instead, each
66
element points to the next. It is a data structure

‎src/data-structures/priority-queue/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Priority Queue
22

3-
In computer science, a priority queue is an abstract data type
3+
In computer science, a **priority queue** is an abstract data type
44
which is like a regular queue or stack data structure, but where
55
additionally each element has a "priority" associated with it.
66
In a priority queue, an element with high priority is served before

‎src/data-structures/queue/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Queue
22

3-
In computer science, a queue is a particular kind of abstract data
3+
In computer science, a **queue** is a particular kind of abstract data
44
type or collection in which the entities in the collection are
55
kept in order and the principle (or only) operations on the
66
collection are the addition of entities to the rear terminal

‎src/data-structures/stack/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Stack
22

3-
In computer science, a stack is an abstract data type that serves
3+
In computer science, a **stack** is an abstract data type that serves
44
as a collection of elements, with two principal operations:
55

66
* **push**, which adds an element to the collection, and

‎src/data-structures/tree/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
* [Segment Tree](segment-tree) - with min/max/sum range queries examples
77
* [Fenwick Tree](fenwick-tree) (Binary Indexed Tree)
88

9-
In computer science, a tree is a widely used abstract data
9+
In computer science, a **tree** is a widely used abstract data
1010
type (ADT) — or data structure implementing this ADT—that
1111
simulates a hierarchical tree structure, with a root value
1212
and subtrees of children with a parent node, represented as

‎src/data-structures/tree/avl-tree/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# AVL Tree
22

3-
In computer science, an AVL tree (named after inventors
3+
In computer science, an **AVL tree** (named after inventors
44
Adelson-Velsky and Landis) is a self-balancing binary search
55
tree. It was the first such data structure to be invented.
66
In an AVL tree, the heights of the two child subtrees of any

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /