python-data-structures
python-data-structures copied to clipboard
heineman
This repository contains the code associated with the "Designing Data Structures in Python: Principles & Practice" Safari Video. https://www.safaribooksonline.com/library/view/designing-data-structure...
There is a value called `ret` declared [here](https://github.com/heineman/python-data-structures/blob/1de93ca99ba564b2ba13113cb3be6855eec8d2d5/4.%20Recursive%20Structures/projectBinaryCounting.py#L136) but I am not sure exactly how it should be used considering its name. Great course btw George. Keep up the great...
I got the impression in some literature people refer to Binary Heap what here is called simply an Heap. May be could be helpfull to make some disambiguation note about...
https://github.com/heineman/python-data-structures/blob/1de93ca99ba564b2ba13113cb3be6855eec8d2d5/5.%20Heap-based%20Structures/binaryHeap.py#L67 Is that line rather `if child + 1 < self.n` ?
``` def remove(self, value): n = self.head last = None while n != None: if n.value == value: if last == None: self.head = self.head.next else: last.next = n.next return...
Dear Sir, I just want to thank you for the great course. Also, I was wondering if presentation slides can be added to this repo the same way presentation slides...
