@OmkarPathak, In the delete method in linkedlist.py the last element will be deleted if the given key is not present and if only the head node is present then there will a reference error for prev node.

So I have made some changes and it works

# deleting an item based on data(or key)
def delete(self, data):
    temp = self.head
    # if data/key is found in head node itself
    if(temp.data == data):
            self.head = temp.next
            temp = None
            return
        else:
            #  else search all the nodes
            while(temp.next):
                if(temp.data == data):
                    break
                prev = temp          #save current node as previous so that we can go on to next node
                temp = temp.next
            
            # node not found
            if temp == None:
                return
            
            prev.next = temp.next
            return

Your code breaks when you try to call insertAtEnd when the list is empty.

Hi Omkar,

Append and Pop will add and remove the elements at the end of list.
Queue follows first come first serve property(FIFO). consider the following example

a = []
a.enqueue(1) # adding the element to empty queue
a
[1]
a.enqueue(2) # adding the second element
[1, 2]
a.dequeue() # removing the first element
a
[2]

To remove the first element use the pop(0) instead of pop()
Nice Collection of tutorials. Great Work!!

Thanks,
Sundeep Gullapudi.

enqueue(): rear = (rear + 1)%size
This logic is not implemented, the present circular queue behaves more or less like queue.

#Array.ipynb file
'The array elements can be accessed in constant time by using the index of the parliculnr element as the subscript.'

want to add this circular doubly linked list program in python . do please assign me @OmkarPathak

Not int or float. I want to use class which is I defined. Plus, I don't use any list or dictionary type inside my class.

class Array(object):
    ''' sizeOfArray: denotes the total size of the array to be initialized
       arrayType: denotes the data type of the array(as all the elements of the array have same data type)
       arrayItems: values at each position of array
    '''
    def __init__(self, sizeOfArray, arrayType = int):
...

Thank you.

It would be nice to add a method to the BST class so that given an unsorted array of integers a balanced BST is constructed. I'm not sure whether it is already in the repo but I have not been able to find it. I'd be happy to take care of it if you find it interesting :)

Hi Omkar!!
Firstly, thanks for this awesome repo. I was facing trouble with opening the Queue.ipynb file, please check the attached image.