Making above given diagram 's   binary tree
root = newNode ( 8 ) NEW_LINE root . left = newNode ( 3 ) NEW_LINE root . left . left = newNode ( 1 ) NEW_LINE root . left . right = newNode ( 6 ) NEW_LINE root . left . right . left = newNode ( 4 ) NEW_LINE root . left . right . right = newNode ( 7 ) NEW_LINE root . right = newNode ( 10 ) NEW_LINE root . right . right = newNode ( 14 ) NEW_LINE root . right . right . left = newNode ( 13 ) NEW_LINE if ( isSumSame ( root ) ) : NEW_LINE INDENT print ( " Sum ▁ of ▁ covered ▁ and ▁ uncovered ▁ is ▁ same " ) NEW_LINE DEDENT else : NEW_LINE INDENT print ( " Sum ▁ of ▁ covered ▁ and ▁ uncovered ▁ is ▁ not ▁ same " ) NEW_LINE DEDENT