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;
19 Cards in this Set
- Front
- Back
|
Queue |
First in First out |
|
|
enqueue |
add item to the back of queue |
|
|
dequeue |
removes item from the front of the queue |
|
|
Elements enter the ... of the queue |
the back of the queue |
|
|
Binary tree |
The empty set is a binary tree. A non-empty binary tree consists of a root node(root node) w two binary trees called the left subtree and the right subtree |
|
|
child |
node 1 below |
|
|
parent |
node below |
|
|
path |
goes all of the way down the tree |
|
|
length |
the number of nodes on a path(EXCLUDING starting node) |
|
|
ancestor |
above a node |
|
|
descendant |
below a node |
|
|
depth of a node |
length of a path from root to that node |
|
|
height of a tree |
One plus the depth of the deepest node |
|
|
leaf |
node w/o children |
|
|
internal node |
node w 1+ child |
|
|
fully binary tree |
every internal node has 0 or 2 children |
|
|
complete binary tree |
fill in every level from left to right |
|
|
Big O of operation on one node |
(o log2n) |
|
|
max heap |
complete binary tree in which the value at every node is less than or equal to the value at its parent. |
