Data Structures — Set 2

A 'Heap' is a specialized tree-based data structure used primarily for implementing which of the following?

Which type of linked list allows for traversal in both forward and backward directions?

In an Array, what is the term used for the position of an element starting from zero?

Which data structure is typically used to represent a file system in a modern computer?

What is the time complexity for searching an element in a balanced Binary Search Tree (BST)?

Which graph representation uses a two-dimensional matrix to show connections between nodes?

Which data structure is used to implement a 'Breadth First Search' (BFS) algorithm on a graph?

Which of the following describes a 'Full Binary Tree'?

The process of rearranging data in a specific order (ascending or descending) is called?

Which data structure allows insertion and deletion from both ends?