Skip to content

Instantly share code, notes, and snippets.

@tomerun
tomerun / BinTree.java
Created August 25, 2012 16:21
Introduction to Algorithm exercise 12.3-6
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Random;
public class BinTree {
static Random rand = new Random();
public static void main(String[] args) throws Exception {
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class Main {
static ArrayList<Integer> ci;
static int[] max;
public static void main(String[] args) throws Exception {
import java.io.File;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class PKU3368 {
static ArrayList<Integer> ci;
static int[] max;
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <stdio.h>
using namespace std;