Category: Data Structure

Sign of the number is the first bit of the storage allocated for that number. So you get one bit less for storing the number. For example if you are storing an 8-bit number,...

NULL can be value for pointer type variables. VOID is a type identifier which has no size. NULL and void are not same. Example: void* ptr = NULL;

STACK follows LIFO. Thus the item that is first entered would be the last removed. In array the items can be entered or removed in any order. Basically each member access is done using...

Create two pointers, each set to the start of the list. Update each as follows: while (pointer1) { pointer1 = pointer1->next; pointer2 = pointer2->next; if (pointer2) pointer2=pointer2->next; if (pointer1 == pointer2) { print (”circularn”);...

A memory leak occurs when a program loses the ability to free a block of dynamically allocated memory.

A node class is a class that, – relies on the base class for services and implementation, provides a wider interface to users than its base class, – relies primarily on virtual functions in...

The easiest sorting method to use in data structures is the standard library function qsort(). It’s the easiest sort by far for several reasons: – It is already written. – It is already debugged....

Unfortunately, the only way to search a linked list is with a linear search, because the only way a linked list’s members can be accessed is sequentially. Sometimes it is quicker to take the...

The heap is where malloc(), calloc(), and realloc() get memory. Getting memory from the heap is much slower than getting it from the stack. On the other hand, the heap is much more flexible...

The radix sort takes a list of integers and puts each element on a smaller list, depending on the value of its least significant byte. Then the small lists are concatenated, and the process...