Syntax Defination

Java Program to make a Client-Server Chat Interface In today's post, i had shared a java program to make a continuous chat interface between the Server and the Client. Note:- To run this program efficiently compile the server code first and the compile the client code.

CPP program to demonstrate Multiple Catch As we know, in exception handling we use the mechanism of try-catch block. In try block the statements are written which can generate the exceptions an to handle those exceptions catch block is written. But in this post there are multiple catch block to handle different kind of exceptions in the program.

C program to find the number of days and months on the basis of given input In this post, I shared a C program to find the total number of months and the remaining days on the basis of the given input from the user.

C program to find the Addition, Subtraction, Division, Multiplication and Modulo of two numbers. In this post, I shared a code to find the simple arithmetic operation results for the given two numbers.

Binary Search Tree A Binary Search Tree (BST) is a tree in which all the nodes follow the below-mentioned properties − The left sub-tree of a node has a key less than or equal to its parent node's key. The right sub-tree of a node has a key greater than to its parent node's key. Thus, BST divides all its sub-trees into two segments; the left sub-tree and the right sub-tree.

Circular Linked List Before going towards the circular linked list, I hope that you have the knowledge about the Doubly Linked List. If not, then click   here . Circular Linked List is little more complicated linked data structure. In the circular linked list we can insert elements anywhere in the list whereas in the array we cannot insert element anywhere in the list because it is in the contiguous memory. In the circular linked list the previous element stores the address of the next element and the last element stores the address of the starting element. The elements points to each other in a circular way which forms a circular chain. The circular linked list has a dynamic size which means the memory can be allocated when it is required.

Doubly Linked List Before going towards the doubly linked list, I hope that you have the knowledge about the Singly Linked List. If not, then click here . Doubly Linked List is a variation of Linked list in which navigation is possible in both ways, either forward and backward easily as compared to Single Linked List. Following are the important terms to understand the concept of doubly linked list.