¼¸ÖÖ³£¼ûµÄÊý¾Ý½á¹¹µÄJAVAʵÏÖ
ÒÀ¾ÉûÓÐÎÄ×Ö˵Ã÷£¬Ö»ÓÐÉÙÁ¿µÄ×¢ÊÍ£¬¶þ²æ²éÕÒÊ÷Óкܶà²Î¿¼×ÊÁÏ£¬ÕâÀï¾Í²»¶à˵ÁË¡£ÏÂÃæ·îÉÏJAVA´úÂë
package utility.structure;
import java.io.Serializable;
import java.security.InvalidParameterException;
import java.util.Comparator;
import java.util.ConcurrentModificationException;
/**
*
* @author odie.tang
* @version 1.0 11/09/09
*/
public class BinarySearchTree<E> implements Comparable<E>,Serializable{
private static final long serialVersionUID = -8154673525487170187L;
/**
* The comparator, or null if priority queue uses elements'
* natural ordering.
*/
private Comparator<? super E> comparator = null;
private E data;
private BinarySearchTree<E> parent = null;
private BinarySearchTree<E> leftChild = null;
private BinarySearchTree<E> rightChild = null;
/**
* level indicates node's level in the whole tree, eg: root's level is 1, and its children's level is 2...
*/
private int level;
/**
* to identify the whether the child is a left child or a right one
*/
enum Child{left,right};
public BinarySearchTree() {
this.level = 0;
}
public BinarySearchTree(Comparator<? super E> comparator){
this.comparator = comparator;
this.level = 0;
}
public BinarySearchTree(E root) {
this(root,null);
}
public BinarySearchTree(E root,Comparator<? super E> comparator){
this.data = root;
this.comparator = comparator;
this.level = 1;
}
private BinarySearchTree(BinarySearchTree<E> parent,Child childType,E child){
this.data = child;
this.parent = parent;
this.level = parent.level + 1;
if (childType == Child.left)
parent.leftChild = this;
else
parent.rightChild = this;
this.comparator = parent.comparator;
}
public void add(E e){
if (this.level == 0){
this.level = 1;
this.data = e;
}
else{
BinarySearchTree<
Ïà¹ØÎĵµ£º
¸öÈ˼òÀú
¸öÈËÐÅÏ¢
ÐÕÃû
£º
Öì½ð¹ú
ÐÔ±ð
£º
ÄÐ
³öÉúÈÕÆÚ
£º
1988
Äê
1
ÔÂ
9
ÈÕ
Email
£º
zhujinguo2009@gmail.com
  ......
1. JavaÓïÑÔ»ù´¡
̸µ½JavaÓïÑÔ»ù´¡Ñ§Ï°µÄÊé¼®£¬´ó¼Ò¿Ï¶¨»áÍÆ¼öBruce EckelµÄ¡¶Thinking in Java¡·¡£ËüÊÇÒ»±¾Ð´µÄÏ൱Éî¿ÌµÄ¼¼ÊõÊé¼®£¬JavaÓïÑÔ»ù´¡²¿·Ö»ù±¾Ã»ÓÐÆäËüÈκÎÒ»±¾Êé¿ÉÒÔ³¬Ô½Ëü¡£¸ÃÊéµÄ×÷ÕßBruce EckelÔÚÍøÂçÉϱ»³ÆÎªÌì²ÅµÄͶ»úÕߣ¬×÷Õߵġ¶Thinking in C++¡·ÔÚ1995ÄêÔø»ñSoftwareDevelopment Jolt Award×î¼ÑÊ ......
package test;
import javax.annotation.Resource;
import javax.servlet.ServletContext;
import javax.servlet.http.HttpServletRequest;
import javax.xml.ws.WebServiceContext;
import javax.xml.ws.handler.MessageContext;
@javax.jws.WebService(targetNamespace = "http://test/", serviceName = "Web ......
Ò»¸öÓÉ Carol Hamer дµÄ±È½ÏÓдú±íÐÔµÄÔ´Â룬×÷ÕßÈ«Á¦ÍƼö£¬ÓÈÆäÊǶÔÓÚûÓÐ J2ME ¿ª·¢¾ÑéµÄÅóÓÑ¡£×Ô¼º¶¯ÊÖÇóöÒÔÏÂÌù³öµÄ Hello.java ºÍ HelloCanvas.java Ô´Â룬²¢ÔËÐУ¬ÓÃÐÄÌå»áһϡ£ÏàÐÅÄãÀí½âÁË´ËÔ´ÂëÖ®ºó£¬¼´¿É²½Èë J2ME ¿ª·¢¡£
×¢ÊͶ¼ÔÚÔ´ÂëÀÔËÐл·¾³×Ô¼ºÅ䣬×Ô¼º¶¯ÊÖ¿´ÔËÐÐЧ¹û£¬Àí½âÖ®ºó£¬È»ºó¶¯ÊÖÐÞ ......
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class BubbleSort {
private static int a[] = new int[12];
private static BufferedReader in = new BufferedReader(
new InputStreamReader(System.in));
public static void bubbleSort(int a[], i ......