Print Within Range BST

#1

Is there any error in the construction of BST because I think I am correct with my logic. In the explaination BST has been constructed somewhat differently.

#2

hey @ap8730390
Is there any error in the construction of BST
Answer : yes
int n = scn.nextInt();
int [] arr = new int[n];

    for(int i = 0; i< arr.length; i++){
        arr[i]= scn.nextInt();
    }

    Arrays.sort(arr);// this is wrong because root Node is change

Add Node Manually . there is No need to sort array
How can you make a tree You can see my code

#3

Thanks for help. Is there any shorter way to do this question because although my code is working now but it’s very big

#4
  1. To create a tree 2. Print Preorder 3. Print Nodes in range using inorder 4. Delete Tree using postorder.
#5

Is there any shorter way to do this question because although my code is working now but it’s very big
Answer . Nope

#6
  1. Delete Tree using postorder. // no need
    If you have no any doubt
    Please mark your doubts as resolved in your course’s.
#7

But I had to delete my tree, otherwise it was showing error in preorder output

#8

Okay .
i am using only 3 operation

  1. create a tree 2. Print Preorder 3. Print Nodes in range
    you can see my code . I have provided the solution link above
#9

code isnt working @Monu-Singh-480654572341490