Initial size needs to be as per the size of root i.e. 0 or 1 or n(if applicable) #108

SmitaPatankar · 2021-08-05T17:53:16Z

Line 24 in ba3e6e6

self.size = 0

User is given flexibility to either create linked list with root as None or with a root node given by them.
i.e. size could be 0 or 1

If applicable:
User can also pass root that already has more next nodes.
i.e. size could be n

But, initial size is always set as 0 instead of calculating and setting it as per above logic

Replaced if else conditionals with try except suite in order to catch IndexErrors if self.heap[1] is attempting to subscript and index out of bounds. In response to issue joeyajames#108.

wvadhy mentioned this issue Jul 29, 2022

Updated peek() function wvadhy/Python#1

Merged

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Initial size needs to be as per the size of root i.e. 0 or 1 or n(if applicable) #108

Initial size needs to be as per the size of root i.e. 0 or 1 or n(if applicable) #108

SmitaPatankar commented Aug 5, 2021

Initial size needs to be as per the size of root i.e. 0 or 1 or n(if applicable) #108

Initial size needs to be as per the size of root i.e. 0 or 1 or n(if applicable) #108

Comments

SmitaPatankar commented Aug 5, 2021