my own implementations: Node- a bare node class for binary search tree problems (unencapsulated) BFS- breadth first search EightQueens- prints out all 92(12 unique) solns to the 8 queens problem
my own implementations: Node- a bare node class for binary search tree problems (unencapsulated) BFS- breadth first search EightQueens- prints out all 92(12 unique) solns to the 8 queens problem