aaronjwood

import java.util.LinkedList;

/**
 * Lexical analyzer for Java arithmetic expressions
 */
public class ArithmeticLexer {
    
    /**
     * Types for this lexical analyzer to analyze
     */

aaronjwood

package main

import (
	"fmt"
	"math/rand"
	"time"
)

type Node struct {
	value int

aaronjwood

import time
import random


class Node:
    def __init__(self, value, left, right):
        self.value = value
        self.left = left
        self.right = right

aaronjwood

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <time.h>

typedef struct node Node;

struct node {
    int value;
    Node *left;

aaronjwood

import java.util.Random;

class Node {
    public int value;
    public Node left;
    public Node right;
}

class Tree {

aaronjwood

var Node = function (value, left, right) {
    this.value = value;
    this.left = left;
    this.right = right;
};

function insert(root, v) {
    if (root == null) {
        root = new Node(v, null, null);
    }

aaronjwood

using System;
using System.Diagnostics;

namespace BinarySearchTree
{
    class Node
    {
        public int value;
        public Node left;
        public Node right;

aaronjwood

package main

func Swap(a, b int) int {
	a = a ^ b
	b = b ^ a
	a = a ^ b

	return a
}

aaronjwood

#include <stdio.h>
#include <string.h>

int main(int argc, char **argv) {
  char buff[15];
  int auth = 0;
  
  printf("\nEnter password: ");
  gets(buff);

aaronjwood

package main

import (
	"flag"
	"fmt"
)

// Time: O(2^n)
// Space: O(n)
func FibRecursive(n uint64) uint64 {