1 Star 0 Fork 0

20202321邬昱初/javastudy

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
BTNode.java 3.09 KB
一键复制 编辑 原始数据 按行查看 历史
20202321邬昱初 提交于 3年前 . 20202321
package LBT;
import java.util.ArrayList;
public class BTNode<T> {
protected T element;
protected BTNode<T> left, right;
public BTNode (T element)
{
this.element = element;
left = right = null;
} //:List<String> list = Arrays.asList(array);
public T getElement()
{
return element; //:List<String> list = Arrays.asList(array);
}
public void setElement (T element)
{
this.element = element;
}
public BTNode<T> getLeft()
{
return left;
}
//:List<String> list = Arrays.asList(array);
public void setLeft (BTNode<T> left)
{ //:List<String> list = Arrays.asList(array);
this.left = left;
}
//:List<String> list = Arrays.asList(array);
public BTNode<T> getRight()
{
return right;
}
//:List<String> list = Arrays.asList(array);
public void setRight (BTNode<T> right)
{
this.right = right;
}
//:List<String> list = Arrays.asList(array);
//:List<String> list = Arrays.asList(array);
public BTNode<T> find (T target)
{ //:List<String> list = Arrays.asList(array);
BTNode<T> result = null;
if (element.equals(target))
result = this;
else
{
if (left != null)
result = left.find(target);
if (result == null && right != null)
result = right.find(target);
} //:List<String> list = Arrays.asList(array);
//:List<String> list = Arrays.asList(array);
return result;
}
//:List<String> list = Arrays.asList(array);
public int count()
{
int result = 1;
if (left != null)
result += left.count();
//:List<String> list = Arrays.asList(array);
if (right != null)
result += right.count();
//:List<String> list = Arrays.asList(array);
return result;
} //:List<String> list = Arrays.asList(array);
public void inorder ( ArrayIterator<T> iter)
{ //:List<String> list = Arrays.asList(array);
if (left != null)
left.inorder (iter);
//:List<String> list = Arrays.asList(array);
iter.add (element);
//:List<String> list = Arrays.asList(array);
if (right != null)
right.inorder (iter);
} //:List<String> list = Arrays.asList(array);
public void preorder ( ArrayIterator<T> iter) {
iter.add(element);
//:List<String> list = Arrays.asList(array);
if(left!=null)
left.preorder(iter);
//:List<String> list = Arrays.asList(array);
if (right != null)
right.preorder(iter);
} //:List<String> list = Arrays.asList(array);
//:List<String> list = Arrays.asList(array);
public void postorder ( ArrayIterator<T> iter) {
if(left != null)
left.postorder(iter);
//:List<String> list = Arrays.asList(array);
if(right != null)
right.postorder(iter);
//:List<String> list = Arrays.asList(array);
iter.add(element);
}
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/wu-yuchu/javastudy.git
git@gitee.com:wu-yuchu/javastudy.git
wu-yuchu
javastudy
javastudy
master

搜索帮助