算法实现-二叉搜索树的构建

构造二叉搜索树

package com.tree;

 

 

public class SearchTree {

 private TreeNode rootNode;

 

 public void createSTree(int[] a){

for(Integer i:a){

this.insertNode(i);

}

 }

 

 public void insertNode(int key){

TreeNode parentNode = null;

TreeNode searchNode = rootNode;

TreeNode insertNode = new TreeNode(key);

parentNode = rootNode;

while(searchNode != null){

parentNode = searchNode;//parent指针始终指向search的当前值

if(insertNode.getKey() > searchNode.getKey()){

searchNode = searchNode.getRight();

}else if(insertNode.getKey() == searchNode.getKey()){

searchNode.increaseNum();

return; 

}else{

searchNode = searchNode.getLeft();

}

}

insertNode.setParentNode(parentNode);//跟新插入节点的父节点指针

//更新父节点的指针

if(parentNode == null){

rootNode = insertNode;//rootNode只有在

}else if(insertNode.getKey() < parentNode.getKey()){

parentNode.setLeft(insertNode);

}else if(insertNode.getKey() > parentNode.getKey()){

parentNode.setRight(insertNode);

}

 }

 

}