Linked List Data structure with C++

linked list(LL) is a linear data structure that includes a series of connected nodes. Here, each node stores the data and the address of the next node. For example,
                                                                                            fig:Data Structure

Comments

Post a Comment

Popular posts from this blog

Image
                                                                                        Graph Theory Graph Theory is ultimately the study of relationships. Given a set of nodes & connections, which can abstract anything from city layouts to computer data, graph theory  provides a helpful tool to quantify & simplify the many moving parts of dynamic systems Weighted vs Unweighted Graph Weighted graphs add additional information to the relationship between two nodes. This is done by assigning a numeric value to the edge  the line that connects the two nodes. This value could represent the distance or how  two nodes are connected. A real world example of a weighted gra...
Read more
                                                                                      Beautiful Matrix time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You've got a  5 × 5  matrix, consisting of  24  zeroes and a single number one. Let's index the matrix rows by numbers from  1  to  5  from top to bottom, let's index the matrix columns by numbers from  1  to  5  from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix: Swap two neighboring matrix rows, that is, rows with indexes  i  and  i  + 1  for some integer  i   (1 ≤  i  < 5) . Swap two neighboring matrix columns, ...
Read more
Image
                                                                          B. Vanya and Lanterns time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vanya walks late at night along a straight street of length  l , lit by  n  lanterns. Consider the coordinate system with the beginning of the street corresponding to the point  0 , and its end corresponding to the point  l . Then the  i -th lantern is at the point  a i . The lantern lights all points of the street that are at the distance of at most  d  from it, where  d  is some positive number, common for all lanterns. Vanya wonders: what is the minimum light radius  d  should the lanterns have to light the whole street? Input The first ...
Read more