It is data structures homework in Istanbul Technical University.
There is an input file first line indicates values of nodes of the tree to be created. They are always placed like the graph given below:
Left to right, top to bottom. It is impossible to add a node on level 3 before fully filling level 2. Or you cannot add new node to right if left is blank.
Second line of input file indicates the target. We will try to find a path in the left sub-tree and another one in right sub-tree which makes the target number whey you sum their nodes. Example:
We need 1 path for each subtree. If program finds more than one, leftest path is valid in the subtree.
Compile it: g++ -std=c++11 -Wall -Werror b_tree.cpp -o b_tree
Run it: ./b_tree input.txt
Run on windows: b_tree input.txt
Remember the first image, there was a series of data like 1, 2, 3, 4, 5... As you can realize, this numbers are ordered with positive integers. Even tree is initialized with different data like 19, 25, 30... there is a secret 1, 2, 3 order in order to their position in the tree. I used this to distinguish whether a node is left or right subtree.
Whenever ptr -> nodeNum < 3*pow(2, floor(log2(ptr->nodeNum)))/2 goes true, you can assume you are in left subtree.