public
Node(E date,
int
parentIndex) {
this
.
date
= date;
this
.
parentIndex
= parentIndex;
}
@Override
public
boolean
equals(Object obj) {
if
(((Node) obj).
date
==
this
.
date
&& ((Node) obj).
parentIndex
==
this
.
parentIndex
)
return
true
;
return
false
;
}
@Override
public
int
hashCode() {
return
super
.hashCode();
}
@Override
public
String toString() {
return
(String)
date
;
}
}
// 默认数组大小
private
final
int
DefSize
= 150;
// 记录节点个数
private
int
nodeSize
;
// 父节点对象
private
Node<E>[]
nodes
;
public
TreeParent() {
nodes
=
new
Node[
DefSize
];
}
public
TreeParent(E e) {
3
/
16