Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
8 Cards in this Set
- Front
- Back
|
Learn Complexities |
http://bigocheatsheet.com |
|
|
What is a Data Structure? |
Is a particular way of organizing data in a computer so it can be used efficiently. |
|
|
What is an Algorithm? |
Is a finite set of rules to follow in order to solve a problem |
|
|
What is a Binary Tree? |
Is a tree (A non linear data structure) in which each node can have maximum 2 children. |
|
|
Explain pre-order, in-oder and post-order traversal with 3 nodes. |
In-Order: Left, Root, Right. Pre-Order: Root, Left, Right. Post-Order: Left, Right, Root. |
|
|
What is a the height of a Binary Tree? |
is the maximum distance from the deepest node to the root |
|
|
Average number of comparisons in a Binary Tree? |
Expected value = P(x) C(x) |
|
|
Depth of a tree? |
number of edges from the root to the node. |
