Author name: Abhay

A function that calls itself is called a recursive function and this technique is called recursion. A recursive function will call itself until a final call that does not require a call to itself is made. It takes advantage of the system stack to temporarily store the calling function’s return address and local variables. There […]

Polish Notation Algebraic expressions can be written using three separate but equivalent notations namely infix, postfix, and prefix notations. Infix Notation The operator symbol is placed between its two operands in most arithmetic operations. This is called infix expression. For example, (A + B) ; here the operator + is placed between the two operands

A stack is a linear data structure in which an element may be inserted or deleted only at one end, called the top of the stack. That is elements are removed from a stack in the reverse order of insertion. Thus stacks are also called LIFO(Last In First Out) lists. The following figure shows a

A header linked list is a type of linked list that has a header node at the beginning of the list. In a header linked list, HEAD points to the header node instead of the first node of the list. The header node does not represent an item in the linked list. This data part

A doubly linked list or two way linked list is a type of linked list that contains a pointer to the next node as well as the previous node in the sequence. That is, each node in a doubly-linked list consists of: data – Data Item. prev – Address of previous node. next – Address