WebSVN – programming – Diff – /cs241/p4/AVLTree.java

         AVLTree temp = new AVLTree( deleteMinimum(right) );
         setThis(temp);
         rebalance(); //fix the balance
         return true;
+    } */
+    public void ira_dm() {
+        System.out.println( this );
+        System.out.println( deleteMinimum( this ) );
+    }
-    private int deleteMinimum( AVLTree tree ) {
+    public AVLTree deleteMinimum( AVLTree tree ) {
-        int tempKey=0;
+        if( tree == NIL ) { return NIL; }
-        if( left == NIL ) {
+        if( tree.left == NIL && tree.right == NIL ) { return NIL; }
-            tempKey = key;
+        if( tree.left == NIL ) {
-            //same as "this = new AVLTree(right.key,right.left,right.right);"
+            return new AVLTree(tree.right.key,tree.right.data,
-            AVLTree temp = new AVLTree(right.key,right.data,right.left,right.right);
+                               tree.right.left,tree.right.right);
-            setThis(temp);
+        }
-        if( left.left == NIL && left.right == NIL ) {
-            tempKey = key;
-            //same as "this = new AVLTree(left.key,left.left,right.right);"
-            AVLTree temp = new AVLTree(left.key,left.data,left.left,right.right);
+        return new AVLTree(tree.key,tree.data,deleteMinimum(tree.left),tree.right);
-            setThis(temp);
-        }
-        return deleteMinimum(left);
+    }
-    */
     private void setThis( AVLTree that ) {
         this.key = that.key;
         this.data = that.data;
         this.height = that.height;
         this.left = that.left;

Subversion Repositories programming

(root)/cs241/p4/AVLTree.java @ 44 – Rev 43 → 44