treeapp.java

数据结构和算法一些demo 包括冒泡排序,选择排序

package com.sort.tree.demo;

public class TreeApp {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Tree theTree = new Tree();
		theTree.insert(25,1.7);
		theTree.insert(50,1.8);
		theTree.insert(75,1.9);
		
		Node find = theTree.find(75);
		if(find != null){
			System.out.println("find the node with key 75 ");
		}
		else{
			System.out.println("could not find the node with key 75");
		}
	}

}