$3.$Add a method breadth to LinkedBST which prints out a

breadth$-$first traversal of the tree. Note: A breadth$-$first

traversal uses a queue! You may use the LinkedQueue

class provided on Canvas and you may use the following

pseudocode in your implementation:

breadth:

Create a queue

Add root to the queue

Loop until queue is empty:

print Node at front of queue

pop Node from queue

add Node$$s left and right children to queue

class AbstractCollection:

def init$($self$,$ source$\_$collection$=$None$)$:

$"""$ Sets the initial state of self, which includes the contents of source$\_$collection $"""$

self.$\_$size $=0$

if source$\_$collection:

for item in source$\_$collection:

self.add$($item$)$

def len$($self$)$:

$"""$ Return the number of items in this collection $"""$

return self.$\_$size

def is$\_$empty$($self$)$:

$"""$ Returns True if the collection is empty and False otherwise $"""$

return len$($self$)==0$

def add$($self$,$ other$)$:

$"""$ Overloads the $+$ operator. A new collection is created with everything from self and other. $"""$

result $=$ type$($self$)($self$)$

for item in other:

result.add$($item$)$

return result

class Node:

$"""$ Represents a Node in a singly$-$linked list $"."$

def init$($self$,$ data, next$=$None$)$:

$"""$ By default, this Node will not link to another Node $"""$

self.data $=$ data

self.next $=$ next

class BinaryNode:

$"""$ Represents a Node in a binary tree $"""$

def init$($self$,$ data, left$=$None, right$=$None$)$:

$"""$ By default, this Node will not have any children $"""$

self.data $=$ data

self.left $=$ left

self.right $=$ right