DataStruct Flashcards

remeber the classical data structure and time/space complexite and the trade off.

1
Q

What is a hash table

A

A hash table is a data structure that contains key value pairs and the time complexity is normally O(1)

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

what is an array.

A

An array is a data structure which contains linearly the data.

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

What is a linked list

A

a linkedlist is a linear data structure normally it is linked by pointers.
precisely is node in linked list contains a value and the pointer to the next node.

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

what is a binary tree

A

A binary tree is a data structure that invoice is not a contest to pointers it’s your present the left node and the right node.

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

what is a hash table

A

hash table is the data structure

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

what is stringbuilder

A

Stream builder is a function

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

what is a stack

A

A stack is a static structure that first in last out

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

what is a queue

A

A queue is a data structure that first in first out

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

what is binary Heap

A

Binary heap is a data structure that in each nodes the descendants are smaller than the value

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

what is tries

A

tries is the data structure that contains the characters in an node and it forms the dictionary. it has a special node containing the star which will present the end of a word

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