4. Prozedurales Programmieren

* Konstruktorprozedur
*/
BinTree mkBinTree( int e ) {
BinTree newbt = new BinTree();
newbt.elem = e;
return newbt;
}
/* Sortiertes Einfügen. Erhält Suchbaumeigenschaft
*/
BinTree sorted_insert( BinTree b, int e ) {
if( b == null ) {
return mkBinTree(e);
} else {
modifying_sorted_ins(b,e);
return b;
} }
void modifying_sorted_ins( BinTree b, int e){
if( e < b.elem ) {
if( b.left == null ) {
b.left = mkBinTree(e);
} else {
modifying_sorted_ins(b.left,e);
}
} else if( b.elem < e ) {
if( b.right == null ) {
b.right = mkBinTree(e);
} else {
modifying_sorted_ins(b.right,e);
}
} }
04.12.08 © A. Poetzsch-Heffter, TU Kaiserslautern
74