binarysearchtreeelement.java

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

/*
 * 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.
 */
//2 Dec 2007
package cn.edu.whu.iss.algorithm.unit12;

import static cn.edu.whu.iss.algorithm.basictools.BasicSortTool.compare;

public class BinarySearchTreeElement<T> implements InterfaceBinarySearchTreeElementMethod,Comparable<T>{

	private BinarySearchTreeElement<T> leftChild,rightChild,parent;
	private T o;
	
	public void setObject(T o) {
		this.o = o;
	}

	public void setLeftChild(BinarySearchTreeElement<T> leftChild) {
		this.leftChild = leftChild;
	}

	public void setRightChild(BinarySearchTreeElement<T> rightChild) {
		this.rightChild = rightChild;
	}

	public BinarySearchTreeElement(T o,BinarySearchTreeElement<T> left,BinarySearchTreeElement<T> right,BinarySearchTreeElement<T> parent){
		this.o = o;
		this.leftChild = left;
		this.rightChild = right;
		this.parent = parent;
	}
	
	public BinarySearchTreeElement(T o){
		this.o  = o;
		leftChild = null;
		rightChild = null;
		parent = null;
	}
	
	public BinarySearchTreeElement<T> getLeftChild() {
		return leftChild;
	}

	public BinarySearchTreeElement<T> getRightChild() {
		return rightChild;
	}

	public BinarySearchTreeElement<T> getParent() {
		return parent;
	}
	
	public T getObject(){
		return o;
	}

	public void setParent(BinarySearchTreeElement<T> parent) {
		this.parent = parent;
	}

	public int compareTo(T o) {
		if (o instanceof BinarySearchTreeElement) {
			return compareWith( (BinarySearchTreeElement<T>) o);
		}else{
			return compare(this.o,o);
		}
	}
	
	public int compareWith(BinarySearchTreeElement<T> o){
		return compare(this.o,o.getObject());
	}

}