Category: Blog

Definitions of member functions for the Linked List class are contained in the LinkedList.cpp file.

A linked list application can be organized into a header file, source file and main application file. The first file is the header file that contains the definition of the NODE structure and the...

The appendNode() member function places a new node at the end of the linked list. The appendNode() requires an integer representing the current data of the node.

Linked List is one of the fundamental data structures. It consists of a sequence of nodes, each containing arbitrary data fields and one or two (‘links’) pointing to the next and/or previous nodes. A...

Each entry in a linked list is called a node. Think of a node as an entry that has three sub entries. One sub entry contains the data, which may be one attribute or...

If there is only one entry possible in the bucket, when the collision occurs, there is no way to accommodate the colliding value. This results in the overlapping of values.

If the ‘pivotal value’ (or the ‘Height factor’) is greater than 1 or less than –1.

The algorithm used in solving the 8 Queens problem is Backtracking.

Here is the list of the applications that make use of Multi linked Structures? – Sparse matrix, – Index generation.

Tree Traversals (Inorder, Preorder and Postorder) Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways. Following are...