Four simple java programs are uploaded in the resource section for your reference. If you are already familiarise with array and its programs you can skip it and go to next section. Otherwise first try to do it yourself and if you have doubt come back and refer here.

The programs that are uploaded are

--> Reversing of array elements

--> Assigning array values at runtime

--> When an element is inputed, it finds the index of that particular element

--> A program to search an element in an array

The linked list implementation code is being uploaded here. This is the same code that have shown in the session. Don't blindly copy it and run, instead try to implement it yourself and then refer if required.

The program for balanced parenthesis is included in the resource section. Please have look if you have doubt in your implementation.

The stack implementation using array as well as linked list are uploaded in resource section.

As I always say, Don't blindly copy the programs that are in resource section and run it. Even if you understand the program flow by going through, if you have to be a good programmer, try to do it by yourself. For sure initially it will be hard for you. But don't give up. Do some paper work, refer the program if you are clueless and then execute it. The satisfaction that you get from your program will be huge.

The queue implementation using array is uploaded in resource section.

The queue implementation using linked list is uploaded in resource section.

Hope you have understood in detail about Binary search tree implementation and about its different operations. The source code is being uploaded in the resource section, you can refer it when needed.

The MaxHeap program is being uploaded in the resource section. Please try to understand the recursive call flow of the implementation. Refer the uploaded program when in doubt.

As you have seen in the video, the edge list is nothing but an array, isn't it? So only way to find out the the adjacent vertices or to check whether a particular edge is present in the vertex is to iterate through this edge list and check.

The program for this is not included because the graph implementation might be similar to what we are going to do in adjacency list implementation. Adjacency list graph implementation is a hybrid model i.e adjacency matrix + edge list. Showing the implementation here will confuse you.

The source code for graph representation using adjacency matrix is being uploaded in resource section. Refer it when in need.

The source code for graph representation using adjacency list is being uploaded in resource section. As said, this hybrid implementation of edge list and adjacency matrix.