tree.java

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

package com.sort.tree.demo;

public class Tree {
	Node root;
	
	public void insert(int id,double dd){
		Node newNode = new Node();
		newNode.iData = id;
		newNode.fData = dd;
		if(root == null)
			root = newNode;
		else{
			Node current = root;
			Node parent;
			while(true){
				parent = current;
				if(id<parent.iData){
					current = parent.leftChild;
					if(current == null){
						parent.leftChild = newNode;
						return;
					}
				}
				else{
					current = parent.leftChild;
					if(current == null){
						parent.rigthChild = newNode;
						return;
					}
				}
			}
		}
	}
	
	public Node find(int key){
		Node currentNode = root;
		while(currentNode.iData != key){
			if(key < currentNode.iData)
				currentNode = currentNode.leftChild;
			else
				currentNode = currentNode.rigthChild;
			if(currentNode == null)
				return null;
		}
		return currentNode;
	}
	
	public void delete(int d){
		
	}
	
}