linknode.java

<算法导论>第二版大部分算法实现. 1. 各类排序和顺序统计学相关 2. 数据结构 2.1 基本数据结构 2.2 散列表 2.3 二叉查找树 2.4 红黑树 2.5 数据结构

/*
 * Copyright (C) 2003-2008 Wang Pengcheng <[e-mail]>
 * Permission is granted to copy, distribute and/or modify this
 * document under the terms of the GNU Free Documentation License,
 * Version 2.0 or any later version published by the Free Software Foundation;
 * with no Invariant Sections.
 * You may obtain a copy of the License at
 *   http://www.gnu.org/licenses/lgpl.txt
 */
//16 Mar 2008
package cn.edu.whu.iss.algorithm.unit10.datastruct;

public class LinkNode<T> extends LinkElement<T>{
	private LinkNode<T> next,head;

	public LinkNode(T o) {
		super(o);
	}

	public LinkNode<T> getHead() {
		return head;
	}

	public void setHead(LinkNode<T> head) {
		this.head = head;
	}

	public LinkNode(T o,LinkNode<T> next){
		super(o);
	}
	
	public LinkNode(LinkNode<T> next) {
		super();
		this.next = next;
	}

	public LinkNode<T> getNext() {
		return next;
	}

	public void setNext(LinkNode<T> next) {
		this.next = next;
	}
	

}