testbst.java

来自「<算法导论>第二版大部分算法实现. 1. 各类排序和顺序统计学相关」· Java 代码 · 共 59 行

/*
 * Copyright (C) 2000-2007 Wang Pengcheng <[e-mail]>
 * Licensed to the Wang Pengcheng under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The LGPL licenses this file to You under the GNU Lesser General Public
 * Licence, Version 2.0  (the "License"); you may not use this file except in
 * compliance with the License.  You may obtain a copy of the License at
 *
 *     http://www.gnu.org/licenses/lgpl.txt
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
//7 Dec 2007
package cn.edu.whu.iss.algorithm.unit12.test;

import cn.edu.whu.iss.algorithm.unit12.BinarySearchTree;
import junit.framework.TestCase;

public class TestBST extends TestCase {

	private static BinarySearchTree<Integer> t = new BinarySearchTree<Integer>();
	private static int N = 10;
	private static void init(){
		for(int i=N;i>0;i--){
			t.insert(i);
		}
	}
	
	public static void main(String[] args) {
		init();
		t.inorderTreeWalk();
		t.delete(1);t.delete(4);
		t.inorderTreeWalk();
	}
	
	public void testInorderTreeWalk() {
		init();
		fail("Not yet implemented");
	}

	public void testInsert() {
		fail("Not yet implemented");
	}

	public void testGetMax() {
		fail("Not yet implemented");
	}

	public void testGetMin() {
		fail("Not yet implemented");
	}

}