[컴퓨터 프로그래밍][자바]바이너리 트리

소개글

바이너리 트리 코드
링크드 리스트 활용

컴파일 실행환경

<b>BinaryTree.java
BoundaryViolationException.java
BTNode.java
DNode.java
EmptyContainerException.java
InvalidPositionException.java
Iterator.java
LinkedBinaryTree.java
List.java
NodeList.java
NodeListIterator.java
NodeListIteratorTest.java
Position.java
PreOrderIterator.java
UseBT.java</b>

본문내용

public interface BinaryTree
{
public boolean isEmpty();
public boolean isInternal( Position v );
public boolean isExternal( Position v );
public boolean isRoot( Position v );

//Traverse Function
public Iterator getIteratorOfTraverseIterator();

//Get Function
public int getSize();
public Position getRoot();
public Position getParent( Position v );
public Position getLeftChild( Position v );
public Position getRightChild( Position v );
public Position getSibling( Position v );
public int getDepth( Position v );
public int getHeight( Position v );

//Set Function
public void setLeftChild( Position v, Object o);
public void setRightChild( Position v, Object o);

//Operate Function
public void expandExternal( Position v );
public void removeInternalOfExternal( Position v ); //INode: internal node, ENode: external node
public Object replaceElement( Position v, Object o );
public void swapElements( Position v, Position w );

}

압축파일 내 파일목록

EmptyContainerException.java
InvalidPositionException.java
Iterator.java
LinkedBinaryTree.java
List.java
NodeList.java
NodeListIterator.java
NodeListIteratorTest.java
Position.java
PreOrderIterator.java
UseBT.java
BinaryTree.java
BoundaryViolationException.java
BTNode.java
DNode.java

참고 자료

없음