-
Path Matrix in Data Structure with Example
Path Matrix refers to a special type of data representation in data structure specially in graph theory. Path Matrix represents the availability of a path from a node to another node. What is Path Matrix? A path matrix is a matrix representing a graph, where each value in m’th row and n’th column project whether…
-
Data Structure Introduction
Data Structure Introduction part discuss about the very basic data structure terms. Data structure is one of basic necessary topics in Computer Science. There are some common terms which are used in data structure. Those are defined below. Data Structure Terms Data: Data are simply value or sets of values. Data Item: A data item…
-
Data Structure in Memory Allocation
What is Data Structure? In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data. What is Memory Allocation?…
-
How to Delete an Element from Binary Search Tree (BST) with C++ Code
What is Tree? In computer science, a tree is a widely used abstract data type that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes. A tree is a nonlinear data structure, compared to arrays, linked lists, stacks and queues which are linear data…
-
Finding Shortest Path Using Warshall’s Algorithm in C++
What is Adjacency Matrix? An adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph. In adjacency matrix row means where the edge from and column means where the edge end. If there is value 0…
-
Traversing Tree in Postorder Sequence Using C++
What is Tree? In computer science, a tree is a widely used abstract data type that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes. A tree is a nonlinear data structure, compared to arrays, linked lists, stacks and queues which are linear data…
-
Traversing Tree in Inorder Sequence Using C++
What is Tree? In computer science, a tree is a widely used abstract data type that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes. A tree is a nonlinear data structure, compared to arrays, linked lists, stacks and queues which are linear data…
-
Introduction to Linked List
What is Linked List? In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence. A linked list is…
-
Polish Notation, Benefits, Tree From Polish Notation, Expression Conversion
What is Polish Notation? Polish notation (PN), also known as normal Polish notation (NPN), Łukasiewicz notation, Warsaw notation, Polish prefix notation or simply prefix notation, is a mathematical notation in which operators precede their operands, in contrast to the more common infix notation, in which operators are placed between operands. Polish Notation refers to the notation in which the operator symbol is placed before its two…
-
Everything About Graph – Graph, Types of Graph, Representation of Graph
What is Graph? In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within mathematics. A graph is a pictorial representation of a set of objects where some pairs of objects are connected by links. The interconnected objects are…
-
Difference between Triangular matrix and Tridiagonal matrix
What is Sparse Matrix? Sparse matrix is a matrix which contains very few non-zero elements. When a sparse matrix is represented with a 2-dimensional array, we waste a lot of space to represent that matrix. For example, consider a matrix of size 100 X 100 containing only 10 non-zero elements. Matrix with a relatively high proportion of zero entries is called sparse matrix.…
-
Two Way List, Importance of Two Way List with Example
What is a two way list? A two way list is a linear collection of data elements, called nodes, where each node N is divided into three parts:- information field, Forward link- which points to the next node and Backward link-which points to the previous node. Why Two Way List is important? The importance of…
