package shujujgou;
public class BST {
static class BSTnode {
String key;
String data;
BSTnode lchild, rchild;
}
static BSTnode insertBST(BSTnode p, String k) {
if (p == null) {
p = new BSTnode();
p.key = k;
p.lchild = p.rchild = null;
} else if (k.compareTo(p.key) == 0) {
// return ;
} else if (k.compareTo(p.key) < 0) {
p.lchild = insertBST(p.lchild, k);
} else if (k.compareTo(p.key) > 0) {
p.rchild = insertBST(p.rchild, k);
}
return p;
}
public static void inOrder(BSTnode node) {
if (node != null) {
inOrder(node.lchild);
System.out.println(node.key);
inOrder(node.rchild);
}
}
/**
* @param args
*/
public static void main(String[] args) {
String strs[] = { "123", "234", "345", "456", "678" };
BSTnode root = null;
for (String string : strs) {
root = insertBST(root, string);
}
inOrder(root);
}
}
java二叉排序树(BST)
最新推荐文章于 2022-09-28 11:11:29 发布