hannah story645

Using the linked list class from homework 3, implement a stack class with the following methods:

push
pop
top

Then use that stack to solve the following problem:

Suppose that you have n queens from a chessboard. Is it possible to place all n queens on the board so that no two queens are in the same row, no two queens are in the same column, and no two queens are on the same diagonal?

Using the linked list class from homework 3, implement a queue class with the following methods:

push
pop
front
back

Then use that queue to solve the following problem:

Write a simulation program of the lines at a grocery store. The program will be similar to the car wash simulation, except that there

Using the code from chapter 10 (https://github.com/ccnycs/csc212/tree/master/code/chap10)

Implement:

the bt_class.template
A function that checks if the binary tree is a binary search tree:

bool isBST()

A function that checks if the binary tree is a max or min heap:

	import twitter

	OAUTH_TOKEN = ""
	OAUTH_SECRET = ""
	CONSUMER_KEY = ""
	CONSUMER_SECRET = ""

	twitter_stream = twitter.TwitterStream(
	auth=twitter.OAuth(OAUTH_TOKEN, OAUTH_SECRET,
	CONSUMER_KEY, CONSUMER_SECRET)

	# packages in environment at /opt/tljh/user:
	#
	# Name Version Build Channel
	absl-py 0.5.0 <pip>
	alembic 1.0.0 <pip>
	amqp 2.3.2 <pip>
	appdirs 1.4.3 py_1 conda-forge
	argon2-cffi 18.3.0 <pip>
	asn1crypto 0.24.0 py36_0
	astor 0.7.1 <pip>

	import numpy as np
	import matplotlib.pyplot as plt
	import matplotlib.ticker as mticker

	fig, ax = plt.subplots()
	s = ax.scatter([0, .5, 1], [1, .5, 0], c=[1,2,3],
	edgecolor='k', s=1000, zorder=10)
	im = ax.matshow([[1,1,1],[2,2,2],[3,3,3]], cmap='RdBu')
	fig.colorbar(s)
	fig.colorbar(im)

	def to24(time):
	try:
	hour, minute, local = time.split(":")
	except (ValueError, AttributeError):
	return time

	h = int(hour)
	m = int(minute)

	if time.endswith('AM'):

	numpy
	scipy
	matplotlib
	cartopy
	netCDF4
	xarray
	pandas
	geopandas
	geoplot
	scikit-image