helper function to pad the list with a different length with zeros

Lazily rebuilds the front stack when a value is needed by pop/peek. When the front_stack empties, rebuild it by reversing the values

Back returns the last element of list l or nil.

Traverse the tree using in-order traversal

Init initializes or clears list l.

InsertAfter inserts a new element e with value v immediately after mark and returns e. If mark is not an element of l, the list is not modified.

InsertBefore inserts a new element e with value v immediately before mark and returns e. If mark is not an element of l, the list is not modified.

Returns the number of elements in the queue (i.e. size/length) go-routine safe.

Creates a new pointer to a new queue.

New returns an initialized list.

NewMinimalHeightBST gives the minimal height tree from the given sorted array

New returns a new, empty binary tree

Remove the top element from the stack and return it's value If the stack is empty, return nil

Prev returns the previous list element or nil.

Push a new element onto the stack

PushBackList inserts a copy of an other list at the back of list l. The lists l and other may be the same.

* Helper function to get a random integer (min, max)*/

* Helper function to get a random integer (min, max)*/

* Helper function to get a random integer (min, max)*/

* Get a random linked list of N elements with data in range (min, max) */

* Get a random linked list of N elements with data in range (min, max) */

method to replace all spaces in a string with ‘%20’ assuming that the string has sufficient space at the end