#Modification 29

Author: amangit1314

binary_search_tree/Deletion_of_a_node_in_bst.java

@@ -0,0 +1,115 @@
+/**
+ * Deletion_of_a_node_in_bst
+ */
+public class Deletion_of_a_node_in_bst {
+    class Node {
+        int key;
+        Node left, right;
+
+        Node(int item) {
+            key = item;
+            left = right = null;
+        }
+    }
+
+    Node root;
+
+    Deletion_of_a_node_in_bst() {
+        root = null;
+    }
+
+    void deleteKey(int key) {
+        root = deleteRec(root, key);
+    }
+
+    Node deleteRec(Node root, int key) {
+        if (root == null)
+            return root;
+        if (key < root.key)
+            root.left = deleteRec(root.left, key);
+        else if (key > root.key)
+            root.right = deleteRec(root.right, key);
+        else {
+            if (root.left == null)
+                return root.right;
+            else if (root.right == null)
+                return root.left;
+
+            root.key = minValue(root.right);
+            root.right = deleteRec(root.right, root.key);
+        }
+        return root;
+    }
+
+    int minValue(Node root) {
+        int minv = root.key;
+        while (root.left != null) {
+            minv = root.left.key;
+            root = root.left;
+        }
+        return minv;
+    }
+
+    void insert(int key) {
+        root = insertRec(root, key);
+    }
+
+    Node insertRec(Node root, int key) {
+        if (root == null) {
+            root = new Node(key);
+            return root;
+        }
+        if (key < root.key)
+            root.left = insertRec(root.left, key);
+        else if (key > root.key)
+            root.right = insertRec(root.right, key);
+        return root;
+    }
+
+    void inorder() {
+        inorderRec(root);
+    }
+
+    void inorderRec(Node root) {
+        if (root != null)
+            inorderRec(root.left);
+        System.out.print(root.key + " ");
+        inorderRec(root.right);
+
+    }
+
+    public static void main(String[] args) {
+        Deletion_of_a_node_in_bst tree = new Deletion_of_a_node_in_bst();
+        // * Let us create following BST
+        // ? 50
+        // ? / \
+        // ? 30 70
+        // ? / \ / \
+        // ?20 40 60 80 */
+        tree.insert(50);
+        tree.insert(30);
+        tree.insert(20);
+        tree.insert(40);
+        tree.insert(70);
+        tree.insert(60);
+        tree.insert(80);
+
+        System.out.println("Inorder traversal of the given tree");
+        tree.inorder();
+
+        System.out.println("\nDelete 20");
+        tree.deleteKey(20);
+        System.out.println("Inorder traversal of the modified tree");
+        tree.inorder();
+
+        System.out.println("\nDelete 30");
+        tree.deleteKey(30);
+        System.out.println("Inorder traversal of the modified tree");
+        tree.inorder();
+
+        System.out.println("\nDelete 50");
+        tree.deleteKey(50);
+        System.out.println("Inorder traversal of the modified tree");
+        tree.inorder();
+    }
+}

binary_search_tree/Find_a_value_in_bst.java

@@ -1,5 +1,3 @@
-package binary_search_tree;
-
 public class Find_a_value_in_bst {
 
     class Node {

bit_manupulation/Count_set_bit_in_integer.class

@@ -0,0 +1,22 @@
+package bit_manipulation;
+
+import java.io.*;
+
+public class Count_set_bit_in_integer {
+    /*
+     * Function to get no of set bits in binary representation of positive integer n
+     */
+    static int countSetBits(int n) {
+        int count = 0;
+        while (n > 0) {
+            count += n & 1;
+            n >>= 1;
+        }
+        return count;
+    }
+
+    public static void main(String[] args) {
+        int i = 9;
+        System.out.println(countSetBits(i));
+    }
+}