Tree - find sum prblm

#1

in the problem of coding blocks tree-find sum
there is given the input of the node values of a balanced tree and asked to find sum of all the nodes so there i should build the tree first and then treaverse or directly add the node values bcoz both willl give the same ans

#2

the question which you have tagged to ask is

Build BST

You are given a sorted data of n integers. You have to form a balanced Binary Search Tree and then print preorder traversal of the tree.

if you want to ask other question please give question proper statement
or ask doubt on your question which you want to ask

#3

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.