OCR A level Computer Science paper 2 Will Well Annalised Answers.
1. Abstraction: Representation that is arrived at by removing unnecessary details
2. Pop: Remove and return the last item from a list/data structure
3. Push: To add an item to the top of a stack/end of a queue/list
4. Depth First Traversal: Each node in one branch is visited before backtracking to explore the next branch.
5. Breadth First Traversal: Begins at a root node and inspects all the neighboring nodes. Then for each of those
neighbor nodes in turn, it inspects their neighbor nodes which were unvisited, and so on.
6. Binary Tree: a tree in which each node has at most two children.
7. Binary Search Tree: A binary tree with the property that for all parent nodes, the left subtree contains only values less
than the parent, and the right subtree contains only values greater than the parent. This means it can be searched quickly
8. Pre-Order Traversal: The process of systematically visiting every node in a tree once, starting with the root node,
proceeding to the left along the tree and accessing the node when the "left" side of the node is encountered.
9. In-Order Traversal: The process of systematically visiting every node in a tree once, starting at the root and
proceeding left down the tree, accessing the first node encountered at its "center", proceeding likewise along the tree, accessing
each node as encountered at the "center".
10. Post-Order Traversal: The process of systematically visiting every node in a tree once, starting at the root and
proceeding left down the tree, accessing the first node encountered at its "right" side, proceeding likewise along the tree, accessing
each node as encountered at its "right" side.
1/4
1. Abstraction: Representation that is arrived at by removing unnecessary details
2. Pop: Remove and return the last item from a list/data structure
3. Push: To add an item to the top of a stack/end of a queue/list
4. Depth First Traversal: Each node in one branch is visited before backtracking to explore the next branch.
5. Breadth First Traversal: Begins at a root node and inspects all the neighboring nodes. Then for each of those
neighbor nodes in turn, it inspects their neighbor nodes which were unvisited, and so on.
6. Binary Tree: a tree in which each node has at most two children.
7. Binary Search Tree: A binary tree with the property that for all parent nodes, the left subtree contains only values less
than the parent, and the right subtree contains only values greater than the parent. This means it can be searched quickly
8. Pre-Order Traversal: The process of systematically visiting every node in a tree once, starting with the root node,
proceeding to the left along the tree and accessing the node when the "left" side of the node is encountered.
9. In-Order Traversal: The process of systematically visiting every node in a tree once, starting at the root and
proceeding left down the tree, accessing the first node encountered at its "center", proceeding likewise along the tree, accessing
each node as encountered at the "center".
10. Post-Order Traversal: The process of systematically visiting every node in a tree once, starting at the root and
proceeding left down the tree, accessing the first node encountered at its "right" side, proceeding likewise along the tree, accessing
each node as encountered at its "right" side.
1/4
