package DataStructure;
public class SearchBinaryTreeTest {
public static void main(String[] args) {
int[] arrTree = new int[] {12,56,32,48,77,98,4,55};
SearchBinaryTree tree = new SearchBinaryTree();
for(int i : arrTree) {
tree.put(i).getData();
}
middOrder(tree.rootNode);
tree.deleteNode(77);
tree.deleteNode(55);
middOrder(tree.rootNode);
}
public static void middOrder(SearchBinaryTreeNode rootNode) {
if(rootNode == null) {
return;
}
middOrder(rootNode.getLeftNode());
System.out.print(rootNode.getData()+" ");
middOrder(rootNode.getRightNode());
}
}
class SearchBinaryTree {
public SearchBinaryTreeNode rootNode;
/**
* ?戜簩?夋?灭储镙戜腑澧炲姞鑺傜偣**/
public SearchBinaryTreeNode put(int data) {
SearchBinaryTreeNode node = null;
node = new SearchBinaryTreeNode(0,data);
/**
* 棣栧厛𫔄ゆ柇璇ヤ簩?夋?灭储镙戠殑镙硅妭镣规槸?︿负绌?*/
if(rootNode == null) {
rootNode = node;
return rootNode;
}
SearchBinaryTreeNode parentNode = rootNode;
SearchBinaryTreeNode currentParentNode = null;
/**
* 𫔄ゆ柇put杩涙?ョ殑鑺傜偣暗€瑕?鏀惧湪鍝釜鑺傜偣镄勪笅??--褰损arentNode镄勫乏瀛?鑺傜偣鎴栬€呭?冲?鑺傜偣涓虹┖鏄纴阃€鍑哄惊鐜?*/
while(parentNode != null) {
currentParentNode = parentNode;
if(data < parentNode.getData()) {
parentNode = parentNode.getLeftNode();
}else if(data > parentNode.getData()) {
parentNode = parentNode.getRightNode();
}else {
return parentNode;
}
}
/**
* 𫔄ゆ柇璇ユ暟?斁鍦ㄥ叾鐖惰妭镣圭殑宸﹁妭镣逛?缃纴杩樻槸?宠妭镣逛?缃?*/
node = new SearchBinaryTreeNode(0,data);
if(data < currentParentNode.getData()) {
currentParentNode.setLeftNode(node);
node.setParentNode(currentParentNode);
}
if(data > currentParentNode.getData()) {
currentParentNode.setRightNode(node);
node.setParentNode(currentParentNode);
}
return node;
}
/**
* 𫔄犻櫎浜屽?夋?灭储涔︿腑镄勬?涓妭镣?*/
public void deleteNode(int data) {
SearchBinaryTreeNode searchNode = searchNode(data);
if(searchNode == null) {
System.out.println("the node doesn't finded !");
return ;
}else {
System.out.println("finding this node is ok,waiting delete!");
delete(searchNode);
}
}
/**
*𫔄犻櫎镆?涓妭镣圭殑鍏蜂𫟄鏂规硶**/
private static void delete(SearchBinaryTreeNode searchNode) {
/**
* 𫔄嗘?琚垹闄よ妭镣圭殑宸﹀?冲?镙戞儏鍐?
* 1.镞犲乏?冲?镙?2.链夊乏瀛?镙戯纴镞犲?冲?镙?3.链夊?冲?镙戯纴镞犲乏瀛?镙?4.镞㈡湁宸﹀?镙戯纴?堟湁?冲?镙?*/
if(searchNode.getLeftNode() == null && searchNode.getRightNode() == null) {
if(searchNode.getParentNode().getLeftNode() == searchNode) {
searchNode.getParentNode().setLeftNode(null);
}
if(searchNode.getParentNode().getRightNode() == searchNode) {
searchNode.getParentNode().setRightNode(null);
}
searchNode.setParentNode(null);
}else if(searchNode.getLeftNode() != null && searchNode.getRightNode() == null) {
if(searchNode.getParentNode().getLeftNode() == searchNode) {
searchNode.getParentNode().setLeftNode(searchNode.getLeftNode());
}
if(searchNode.getParentNode().getRightNode() == searchNode) {
searchNode.getParentNode().setRightNode(searchNode.getLeftNode());
}
searchNode.getLeftNode().setParentNode(searchNode.getParentNode());
}else if(searchNode.getLeftNode() == null && searchNode.getRightNode() != null) {
if(searchNode.getParentNode().getLeftNode() == searchNode) {
searchNode.getParentNode().setLeftNode(searchNode.getRightNode());
}
if(searchNode.getParentNode().getRightNode() == searchNode) {
searchNode.getParentNode().setRightNode(searchNode.getRightNode());
}
searchNode.getRightNode().setParentNode(searchNode.getParentNode());
}else {
/**
* 4.镞㈡湁宸﹀?镙戯纴?堟湁?冲?镙戠殑𨱍呭喌涓嬶纴暗€瑕?镓惧埌璇ヨ妭镣圭殑鍓?椹卞拰?庣户鑺傜偣**/
SearchBinaryTreeNode nextNode = getNextNode(searchNode);
delete(nextNode);
searchNode.setData(nextNode.getData());
}
}
private static SearchBinaryTreeNode getNextNode(SearchBinaryTreeNode searchNode) {
if(searchNode == null) {
return null;
}else {
/**
* 镆ユ垒?庣户鑺傜偣镄勮𫔄欙细
* 1.濡傛灉璇ヨ妭镣规湁?冲?镙戯纴闾ｄ箞璇ヨ妭镣圭殑?庣户鑺傜偣涓猴纴?冲?镙戜腑镄勬渶灏?val炼?
* 2.**/
if(searchNode.getRightNode() != null) {
/**
* 镓捐鑺傜偣镄勫?冲?镙戜腑镄勬渶灏?炼艰妭镣?*/
SearchBinaryTreeNode minNode = getMinNode(searchNode.getRightNode());
return minNode;
}else {
/**
* 褰撹鑺傜偣娌℃湁?冲?镙戞椂锛屽垽鏂鑺傜偣涓庡叾鐖惰妭镣圭殑鍏崇郴**/
if(searchNode.getParentNode().getLeftNode() == searchNode) {
return searchNode.getParentNode();
}
if(searchNode.getParentNode().getRightNode() == searchNode) {
while(searchNode == searchNode.getParentNode().getRightNode()) {
searchNode = searchNode.getParentNode();
searchNode.setParentNode(searchNode.getParentNode().getParentNode());
}
}
}
}
return searchNode.getParentNode();
}
/**
* 镓捐鑺傜偣镄勫?冲?镙戜腑镄勬渶灏?炼艰妭镣?*/
private static SearchBinaryTreeNode getMinNode(SearchBinaryTreeNode node) {
if(node == null) {
return null;
}else {
while(node != null) {
node = node.getLeftNode();
}
}
return node;
}
/**
* 𫔄犻櫎镆?涓妭镣逛箣鍓?锛岄渶瑕?鍏埚垽鏂簩?夋?灭储镙戜腑鏄?︽湁璇ヨ妭镣?*/
private SearchBinaryTreeNode searchNode(int data) {
SearchBinaryTreeNode currentRootNode = rootNode;
if(currentRootNode == null) {
System.out.println("this binaryTree is null!");
return null;
}else {
while(currentRootNode != null && currentRootNode.getData() != data) {
if(data < currentRootNode.getData()) {
currentRootNode = currentRootNode.getLeftNode();
}if(data > currentRootNode.getData()) {
currentRootNode = currentRootNode.getRightNode();
}
}
return currentRootNode;
}
}
}
class SearchBinaryTreeNode {
private int index;
private int data;
private SearchBinaryTreeNode leftNode;
private SearchBinaryTreeNode rightNode;
private SearchBinaryTreeNode parentNode;
public SearchBinaryTreeNode(int index,int data) {
this.index = index;
this.data = data;
this.leftNode = null;
this.rightNode = null;
this.parentNode = null;
}
public int getIndex() {
return index;
}
public void setIndex(int index) {
this.index = index;
}
public int getData() {
return data;
}
public void setData(int data) {
this.data = data;
}
public SearchBinaryTreeNode getLeftNode() {
return leftNode;
}
public void setLeftNode(SearchBinaryTreeNode leftNode) {
this.leftNode = leftNode;
}
public SearchBinaryTreeNode getRightNode() {
return rightNode;
}
public void setRightNode(SearchBinaryTreeNode rightNode) {
this.rightNode = rightNode;
}
public SearchBinaryTreeNode getParentNode() {
return parentNode;
}
public void setParentNode(SearchBinaryTreeNode parentNode) {
this.parentNode = parentNode;
}
}