Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Data Structures > Final > Flashcards

Final Flashcards

1
Q

A list in which every node has a successor; the “last” element is succeeded by the “first” element

A

Circular linked list

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

A linked list in which each node is linked to both its successor and its predessor

A

Doubly linked list

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

A systematic way of visiting all the nodes in a binary tree by visiting the nodes in the left subtree of a node, then visiting the nodes in the right subtree of the node, and then visiting the node

A

Postorder traversal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

A placeholder node at the end of a list; used to simplify list processing

A

Trailer node

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

A list in which elements are placed in no particular order; the only relationship between data elements is the predecessor and successor relationships

A

Unsorted list

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

A binary tree in which the value in any node is greater than or equal to the value in its left child and any of its descendants (the nodes in the left subtree) and less than the value in its right child and any of its descendants (the nodes in the right subtree)

A

Binary search tree

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

A binary tree that is either full or full through the next-to-last level, with the leaves on the last level as far to the left as possible

A

Complete binary tree

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

A tree in which each node is capable of having two child nodes: a left child node and a right child node

A

Binary tree

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Perform more than one task at a time

A

Multitask

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

A tree node that has no children

A

Leaf

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Several interacting code sequences are executing simultaneously, possilby through an interleaving of the statements by a single processor, possibly through execution on distinct processors

A

Concurrency

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Each element except the first has a unique predecessor, and each element except the last has a unique successor

A

Linear relationship

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

A placeholder node at the beginning of a list; used to simplify list processing

A

Header node

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

A child of a node, or a child of a parent

A

Descendant

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

A collection that exhibits a linear relationship among its elements

A

List

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

The top node of a tree structure; a node with no parent

A

Root

17
Q

A method that return an element of a data structure and advances the current position to the next element

A

Iterator method

18
Q

A systematic way of visiting all the nodes in a binary tree by visiting the nodes in the left subtree of a node, then visiting the node, and then visiting the nodes in the right subtree of the node

A

Inorder traversal

19
Q

A structure in which elements are added to the rear and removed from the front; a “first in, first out” (FIFO) structure

A

Queue

20
Q

A systematic way of visiting all the nodes in a binary tree by visiting a node, then visiting the nodes in the left subtree of the node, and then visiting the nodes in the right subtree of the node

A

Preorder traversal

21
Q

A parent of a node, or a parent of an ancestor

A

Ancestor

22
Q

A binary tree in which all of the leaves are on the same level and every nonleaf node has two children

A

Full binary tree

23
Q

A list in which each element has an index value associated with it

A

Indexed list

24
Q

A structure with a unique starting node (the root), in which each node is capable of having multiple child nodes, and in which a unique path exists from the root to every other node

A

Tree

25
Q

An implementation of a priority queue based on a complete binary tree, each of whose elements contains a value that is greater than or equal to the value of each of its children

A

Heap

26
Q

The number of elements in a list; the size can vary over time

A

Size

27
Q

A list that is sorted by some property of its elements; there is an ordered relationship among the elements in the list, reflected by their relative positions

A

Sorted list

28
Q

A mechanism that allows us to process the elements of a data structure one at a time in a given element

A

Iteration

29
Q

The attributes that are used to determine the logical order of the elements in a collection

A

Key

Data Structures (6 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions