quatrix

## ai.html
<!DOCTYPE HTML>
<html>
<head>
<style>
    body {
        background-color: black;
    }
    #mycanvas {
        background-color: black;
        font-color: green;

## weighted_trees.py
"""
Write code that, given a tree with weighted nodes, prints, for each node,
the weight of the subtree rooted at that node (each node only knows it's own ID,
it's parent's ID and it's own weight).

e.g
you get a csv with the following format:

 id, parent, weight

## game_of_life.py
import time

def print_board(board):
    for row in board:
        for column in row:
            print(column),
        print("")
    print("- " * len(board[0]))

def count_neighbours(x, y, board):

## min_heap.py
import unittest
from functools import partial


class BinaryTree(object):
    """
    In computer science, a binary tree is a tree data structure in which each
    node has at most two children (referred to as the left child and the right
    child).


## min_heap.py
import unittest
from functools import partial


class BinaryTree(object):
    """
    In computer science, a binary tree is a tree data structure in which each
    node has at most two children (referred to as the left child and the right
    child).


## testing_ios_webview_cookie
- (void)viewDidLoad {
    [super viewDidLoad];

	// cookie setting
	[[NSHTTPCookieStorage sharedHTTPCookieStorage] setCookieAcceptPolicy:NSHTTPCookieAcceptPolicyAlways];

	NSMutableDictionary *cookieProperties = [NSMutableDictionary dictionary];
	[cookieProperties setObject:@"vova" forKey:NSHTTPCookieName];
	[cookieProperties setObject:@"pita" forKey:NSHTTPCookieValue];
	[cookieProperties setObject:@"mail.walla.co.il" forKey:NSHTTPCookieDomain];
	<!DOCTYPE HTML>
	<html>
	<head>
	<style>
	body {
	background-color: black;
	}
	#mycanvas {
	background-color: black;
	font-color: green;
	"""
	Write code that, given a tree with weighted nodes, prints, for each node,
	the weight of the subtree rooted at that node (each node only knows it's own ID,
	it's parent's ID and it's own weight).

	e.g
	you get a csv with the following format:

	id, parent, weight
	import time

	def print_board(board):
	for row in board:
	for column in row:
	print(column),
	print("")
	print("- " * len(board[0]))

	def count_neighbours(x, y, board):
	import unittest
	from functools import partial


	class BinaryTree(object):
	"""
	In computer science, a binary tree is a tree data structure in which each
	node has at most two children (referred to as the left child and the right
	child).
	- (void)viewDidLoad {
	[super viewDidLoad];

	// cookie setting
	[[NSHTTPCookieStorage sharedHTTPCookieStorage] setCookieAcceptPolicy:NSHTTPCookieAcceptPolicyAlways];

	NSMutableDictionary *cookieProperties = [NSMutableDictionary dictionary];
	[cookieProperties setObject:@"vova" forKey:NSHTTPCookieName];
	[cookieProperties setObject:@"pita" forKey:NSHTTPCookieValue];
	[cookieProperties setObject:@"mail.walla.co.il" forKey:NSHTTPCookieDomain];