javaʵÏÖÊ÷ÈÝÒ×Âð - Java / Java SE
ÓÃjavaʵÏÖÊ÷ÈÝÒ×Âð£¿Ê÷µÄÄÚÈÝÊÇÀ´Ô´±í¡£ÓÐÏà¹ØµÄ´úÂëÂð£¿ÎÒ¿ÉÒԲο¼Ò»Ï¡£
˵ÄѲ»ÄÑ ËµÈÝÒײ»ÈÝÒ×
Java code:
¸øÄãÒ»¸ö´úÂ루¶þ²æËÑË÷Ê÷£©±È½Ï¼òµ¥¿ÉÒÔ×Ô¼º¸Ä¸Ä
package test;
/**
* ½Úµã
* @author Administrator
*/
public class Node {
int i;
Node leftNode;
Node rightNode;
}
-------------------------¡µ¡µ¡µ¡µ¡µ
package test;
import java.util.Random;
/**
* ¶þ²æËÑË÷Ê÷
* @author Administrator
*
*/
public class Tree {
Node root;//¸ù½Úµã
/**
* ²éÕÒ½Úµã
* @param key ²éÕҵĹؼü×Ö
* @return ¹Ø¼ü×ÖËùÔÚ½Úµã
*/
public Node find(int key){
Node currentNode = root;
while(currentNode.i != key){
if(key > currentNode.i){
currentNode = currentNode.rightNode;
}else{
currentNode = currentNode.leftNode;
}
if(null == currentNode){
return null;
}
}
return currentNode;
}
/**
* ²éÕÒ×î´óµÄ½Úµã
* @return ×î´óµÄ½Úµã
*/
public Node findMax(){
Node currentNode = root;
while(null != currentNode.rightNode){
currentNode = currentNode.rightNode;
}
return currentNode;
}
/**
* ²éÕÒ×îСµÄ½Úµã
* @return ×îСµÄ½Úµã
*/
public Node findMin(){
Node currentNode = root;
while(null != currentNode.leftNode){
currentNode = currentNode.leftNode;
}
return currentNode;
}
/**
* ±éÀúÊ÷
* @param node
*/
public void traverse(Node node){
if(null != node){
traverse(node.leftNode);
System.out.println(node.i);
traverse(node.rig
Ïà¹ØÎÊ´ð£º
¸÷·´óÏÀ¸ø¸ö˼·£¬²»ÊÇÔÚÏßµÄÄÇÖÖ£¬¾ÍÊÇÒ»¸ö×öÆÕͨµÄÓ¦ÓóÌÐò¡£
´Ê¿âÔõôÉú³ÉÄØ£¿
²»»á¡£
ÒýÓÃ
´Ê¿âÔõôÉú³ÉÄØ£¿
ÕÒ±¾×Öµä
ÒýÓÃ
´Ê¿âÔõôÉú³ÉÄØ£¿
Êý¾Ý¿â ºÇºÇ
ÓÃmap ¼üÖµ¶ÔÓ¦
Èç¹ûÓÃÊý¾Ý¿ ......
ÇëÎÒÓÃFCKÉÏ´«Îļþ,ÔÚ±¾µØµÄwindows»úÉϲâÊÔ¿ÉÒÔ£¬µ«²¿Êðµ½linux·þÎñÆ÷ÉϾÍÉÏ´«²»ÁËÎļþ£¬ÉÏ´«Îļþʱһֱ¿¨ÔÚÄÇÀï¡£Íû¸÷λ´óϺָµã£¬Ð»Ð»£¡
·¹ý£¬°ïÄ㶥һϡ£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£¡£
ÉÏ´«ÎļþµÄ·¾¶ÎÊÌ⣬ ......
ÌâÄ¿£º
ÓÐ1,2,3£¬4,5,6Áù¸öÊý×ÖÅÅÐò£¬ÓÃjava³ÌÐò¼ÆËã³öÅÅÐòµÄÖÖÀà¡£
ÒªÇó£ºÒ»£¬ÒÔ4¿ªÍ·
¶þ£¬2,3²»ÄÜÏàÁÚ
Èý£¬²»ÄÜÒÔ5¿ªÍ·
Ï£Íû´ó¼ÒÄܼ´ ......
È磺 @superwaring("unchecked");
Õâ¸öÀïÃæ¶¼¿ÉÒÔÈ¡ÄÄЩֵ°¡£¬»¹ÓÐÀàËÆµÄ @superwaring±êÇ©ÓÐÄÄЩ°¡
ûÓùý¡£¡£
¿´jeeµÄapi
javax.persistenceÀï
@superwaring("unchecked");Ö»ÊǺöÂÔ ......