Data Structure

This condition is checked into the stack before performing the 'insertion' operation.

In this tree, every level, except possibly the last, is completely filled.

The last node is replaced with the address of the first node.

This type of graph has more than one edge between the same two vertices.

This is a transitive relation defined on the elements of the list and specified by the sequence in which the elements appear within the list.

Processing of each node of linked list exactly once is also called traversing.

This technique is used to collect all the free cells and store them in free pool.

Traversing begins with the root, then proceeds towards the end of the left subtree and then, towards the right subtree.

This condition must be verified before inserting a new element into the stack.

This type of graph can be defined as a graph with no path that starts and ends at the same vertex.

A spanning tree can be defined as an undirected tree of a connected graph G which is composed of all the vertices and the edges necessary to connect all the nodes of graph G.

This property of list structure is the maximum level attributed to any element within the list or within any sublist in the list.

This technique can be used for implementing indexes.

This part is read and written by a system.

This type of an external sorting is the one in which the basic idea is to distribute ordered initial runs of predetermined size on the available tapes and repeatedly merge these runs in multiple phases, in which each phase has a predetermined number of merges before the target tape is selected.