Binary Search Tree : Insertion

  • + 0 comments

    if(root == null) { root = new Node(data); } else if(data < root.data) { root.left = insert(root.left, data); } else { root.right = insert(root.right, data); } return root;