Databases
StackOverflow2013
Postsdbo
PODelete a node in Binary Search Tree
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PODelete a node in Binary Search Tree
    primarykey
    data
    text
    <p>I have a test code for BST. The BST is created, but the node deletion is not working properly. Any help to suggest if the below delete code is correct or any modification in delete method would be very helpful.</p> <pre><code>public class BinarySearchTree { public BinarySearchTree() { super(); } private class BinarySearchTreeNode{ private int data; private BinarySearchTreeNode left; private BinarySearchTreeNode right; public BinarySearchTreeNode(){ } public BinarySearchTreeNode(int data){ this.data = data; } public void setData(int data) { this.data = data; } public int getData() { return data; } public void setLeft(BinarySearchTree.BinarySearchTreeNode left) { this.left = left; } public BinarySearchTree.BinarySearchTreeNode getLeft() { return left; } public void setRight(BinarySearchTree.BinarySearchTreeNode right) { this.right = right; } public BinarySearchTree.BinarySearchTreeNode getRight() { return right; } } public BinarySearchTreeNode insertRec(BinarySearchTreeNode root,int data){ if(root == null){ root = new BinarySearchTreeNode(); root.setData(data); root.setLeft(null); root.setRight(null); }else{ if(data &lt; root.getData()) root.setLeft(insertRec(root.getLeft(), data)); else if(data &gt; root.getData()) root.setRight(insertRec(root.getRight(), data)); } return root; } public void insertNonRec(BinarySearchTreeNode root,int data){ if(root == null){ root = new BinarySearchTreeNode(data); root.setLeft(null); root.setRight(null); }else{ if(data &lt; root.getData()){ if(root.getLeft() != null){ insertNonRec(root.getLeft(),data); }else{ root.setLeft(new BinarySearchTreeNode(data)); } }else if(data &gt; root.getData()){ if(root.getRight() != null){ insertNonRec(root.getRight(), data); }else{ root.setRight(new BinarySearchTreeNode(data)); } } } } public void delete(BinarySearchTreeNode root,int data){ BinarySearchTreeNode temp; if(root == null){ System.out.println("No elemets in BST."); }else if(data &lt; root.getData()){ delete(root.getLeft(),data); }else if(data &gt; root.getData()){ delete(root.getRight(),data); }else{ if((root.getLeft() != null) &amp;&amp; (root.getRight() != null)){ // Replace with largest in left subtree temp = findMax(root.getLeft()); root.setData(temp.getData()); delete(root.getLeft(),temp.getData()); }else if(root.getLeft() != null || root.getRight() != null){ // One child if(root.getLeft() == null){ //root = root.getRight(); root.setData(root.getRight().getData()); root.setRight(null); }else if(root.getRight() == null){ //root = root.getLeft(); root.setData(root.getLeft().getData()); root.setLeft(null); } }else{ root = null; } } } public BinarySearchTreeNode findMax(BinarySearchTreeNode root){ if(root == null) return null; while(root.getRight() != null) root = root.getLeft(); return root; } public BinarySearchTreeNode findMin(BinarySearchTreeNode root){ if(root == null) return null; while(root.getLeft() != null) root = root.getLeft(); return root; } public void inOrderRec(BinarySearchTreeNode root){ if(root != null){ inOrderRec(root.getLeft()); System.out.print(root.getData() + " "); inOrderRec(root.getRight()); } } public static void main(String args[]){ BinarySearchTree tree = new BinarySearchTree(); BinarySearchTreeNode root = tree.insertRec(null, 10); tree.insertNonRec(root, 5); tree.insertNonRec(root, 20); tree.insertNonRec(root, 4); tree.insertNonRec(root, 8); tree.insertNonRec(root, 12); tree.insertNonRec(root, 30); tree.insertNonRec(root, 11); tree.insertNonRec(root, 13); System.out.println("InOrder Traversal :"); tree.inOrderRec(root); tree.delete(root, 20); System.out.println(""); System.out.println("InOrder Traversal :"); tree.inOrderRec(root); } } </code></pre> <p>Output :</p> <pre><code>InOrder Traversal : 4 5 8 10 11 12 13 20 30 InOrder Traversal : 4 5 8 10 11 12 13 11 30 </code></pre>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USDukeling
    1. USAkash Khanna
    plurals
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload