Question

Write a public method “getSum()” that returns the sum of all elements in binary tree. [Please check that the data are integers, otherwise throws exception]. Note: you should use internal recursive private method to print all paths.

java

Answer 1

Below is the Java function getSum which will recursively compute sum of all the nodes data value if all of them are integer, otherwise throw the exception if any of the data is not integer.

int getSum(node *root)

{

if (root == NULL) //if the root is NULL then simply return 0

return (0) ;

try

{

if ( root->data == (int) root->data) //then data is integer

return (root->data + getSum(root->left)+getSum(root->right));

else //throw the exception

throw new NotAnIntegerException();

}

catch (NotAnIntegerException )

{

System.out.Println("Data is not an integer");

}

}

Please comment for any clarification