Any binary tree with n leaf nodes will have 2n - 1 nodes total. Hence the number of n leaf node will be (2n - 1) - n = n -1

Insertion can be done at the rear end and the deletion can be done only at the Front.

Time and Space are the two measure factors which determines the efficiency of the algorithms.

Divide and Conquer is an algorithm design paradigm, based on recursion and is used for the Quicksort in which the original problem is divided in to the sub problems and are solved recursively.

This function allocates the memory and returns the pointer to the allocated memory.

Radix sort is the method that many people intuitively use or begin to use when alphabetizing a large list of names. Specifically the list of names is first sorted according to the first letter of each name.

Scanf terminates at space character so it is not used for string/Array. get(a) is the right choice for the purpose.

Finding the location of the record with the given key value.

Bubble sort.

This is the Property of B-Tree.

These are the three extension files created after developing a c program, compiling and building to run.

It is to rollback the entered data stored in stack. It is a TCL command.

Physical Layer,Data Link Layer, Network Layer, Transport Layer, Application Layer

These are two specific functions used for single character input and output of data.

In the Depth First Search the traversal in which one node is selected as the start point. It is visited and marked, then all unvisited nodes adjacent to the next nodes are visited and marked in the some sequential order. Finally , the unvisited nodes immediately adjacent to these nodes are visited and marked and so forth, until the entire edges are traversed.