Sir, what the mistake am i doing?

#1

please check it ->https://ide.codingblocks.com/s/469051

#2

hello @chandreshmaurya

after the array manipulation the array b will not be sorted hence u cant use the method that u r using to construct the tree

#3

sir, kya arrey b, modified bst ka inorder sequence hoga? because maine print kr ke dekha to array b, modified bst ka inorder sequence aaya

#4
#5

mai bol raha tah ki array b sorted nahi hai.

aur tum jo tree construction method use kar rahe ho wo sorted array pe valid hota hai.
baaki ye kaam isiliye karega kyunki original array sorted thi
check now->

#6

sir, i have need of approach for this question.

#7

refer this->
We can do it using a single traversal. The idea is to use following BST property. If we do reverse Inorder traversal of BST, we get all nodes in decreasing order. We do reverse Inorder traversal and keep track of the sum of all nodes visited so far, we add this sum to every node.

#8

sir, please isse ek bar dekhiye… mera whi code sare test case ke liye pass ho gya. code -> https://ide.codingblocks.com/s/469097

#9

bro ye to pehle hi bol raha tha , mera previous reply padho,usme already tumhara updated code attach kiya hua hai

#10

ooh sir sorry, aapne comment nhi kiya tha na, isliye uspe meri nzar nhi padi. Thank you sir, Now it’s cleared.

#11

But, sir ye method shi hai na ?

#12

…

ha is question ke lie kaam karega.

#13

oohkay sir, Thank you

#14

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.