BST.java revision 7c478bd95313f5f23a4c958a745db2134aa03244
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
*
* ident "%Z%%M% %I% %E% SMI"
*
* Copyright (c) 1999 by Sun Microsystems, Inc.
* All rights reserved.
*
* BST.java
* Simple binary search tree implementation for help articles
*
*/
// these should be protected...
static public int comparisons;
// Debug.info("HELP: New BST(" + theItem + ")");
}
public BST() {
}
}
// normal bst insertion
if (comp == 0) {
} else if (comp > 0) {
else
} else if (comp < 0) {
else
}
return node;
}
}
}
/*
Debug.info("HELP: Finding " +(exactMatch ? "exact " : "partial ") +
newKey);
*/
++comparisons;
if (comp > 0) {
} else if (comp < 0) {
} else {
rv = this;
// Debug.info("HELP: Found " + newKey + " in " + data);
}
return rv;
}
newKey);
++comparisons;
if (comp > 0) {
} else if (comp < 0) {
} else {
}
return rv;
}
public void traverse() {
}
public void traverse_right() {
}
return;
}
// empty search string is a wildcard...
/*
* Debug.info("HELP: traverse_find_vector: node " +
* data.key + "[" +(left!=null?left.data.key:"null") + "]" +
* "[" +(right!=null ?right.data.key:"null") + "]" +
* " seeking " + key);
*/
int c = 0;
/*
* Debug.info("HELP: traverse_find_vector: compare " +
* data.key + " to "+ key + " = " + c);
*/
if (c == 0) {
// Debug.info("HELP: traverse_find_vector: adding " + data.key);
}
if (c <= 0) {
}
}
public void dump() {
else
else
}
" comparisons\n");
" comparisons\n");
" comparisons\n");
" comparisons\n");
" comparisons\n");
" comparisons\n");
" comparisons\n");
" comparisons\n");
" comparisons\n");
" comparisons\n");
{
}
}
}