binary tree

[satyam878]

Issue Id you have worked upon -

416

Briefly explain your program logic -

In this question i have use the indexes of the preorder array. We use the basic property of BST i.e, right subtree has bigger value and left tree has smaller value than the root.

Screenshots(Attach 2 screenshots of your own input and output) -

Checklist:

Eg - If your code follow the below guidelines. Kindly change [] to [x]

All the conditions should be fulfilled for considering your code for merging -

• [x] I have mentioned the question as comment in my solution file.
  

• [x] My code follows the guidelines of this project.
  

• [x] I have performed a self-review of my own code.
  

• [x] I have commented my code.
  

• [x] My code gives the correct output.
  

• [x] I confirm that I have not copied the code from anywhere. In case its found that I have copied even after successful merge then I can be banned from the repository and hacktoberfest.
  

• [x] I affirm that I strictly follow contributing guidelines and code of conduct.

[satyam878]

Kindly accept my pull request @SarthakKeshari

[SarthakKeshari]

@satyam878, I Appreciate the code presentation, organization and commenting Appreciating by Leveling up your question from level2 to level3