Binary Search Tree - adding every node into one result

Question

I try to add every node into one result in iterate way in Java. For example: if I have a root 5 which has got right node = 7 and left node=3 the result is 15. I\'ve tried in man