java bst insert a node
...for inserting an element.
Start from the root.
Compare the element to be inserted with the root node. If it is less
than root, then traverse the left subtree or traverse the right subtree.
Traverse the subtree till the end of the desired subtree.
Insert the node in the appropriate subtree as a leaf node.binary search tree insert java
public static Node insert(Node root, int x){
if (root == null)
return new Node(x);
else if(x>root.getData())
root.setRightChild(insert(root.getRightChild(),x));
else
root.setLeftChild(insert(root.getLeftChild(),x));
return root;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
