Data Structure and Algorithms Semi-Final Examination

Is a non-linear data structure consisting of vertices and edges.

• Tree

• Graph

• Binary Tree

• Quad Tree

Hierarchical structure that is used to represent and organize data in a way that is easy to navigate and search.

• Tree

• Graph

• Binary Tree

• Quad Tree

Trees used to efficiently store data of points on a two-dimensional space.

• Tree

• Graph

• Binary Tree

• Quad Tree

A tree data structure in which each node can have at most two children, which are referred to as the left child and the right child.

• Tree

• Graph

• Binary Tree

• Quad Tree

A special type of binary tree in which the left child of a node has a value less than the node’s value and the right child has a value greater than the node’s value.

• Binary Search Tree

• Binary Tree

• Tree

• Quad Tree

In this method, the graph is stored in the form of the 2D matrix where rows and columns denote vertices.

• Adjacency List

• Adjacency Matrix

This graph is represented as a collection of linked lists. There is an array of pointer which points to the edges connected to that vertex.

• Adjacency List

• Adjacency Matrix

A Tree data structure used to efficiently store data of points on a two-dimensional space. In this tree, each node has at most four children.

• Tree

• Graph

• Binary Tree

• Quad Tree

The topmost node in a binary tree is called the ______________.

• Leaves

• Root

• Leaf

• Trunk

The bottom-most nodes in a binary tree are called ____________.

• Leaves

• Root

• Leaf

• Trunk