@@ -6,7 +6,7 @@ class Node {
66 }
77}
88
9- function differenceSumOfOddAndEven ( root ) {
9+ function differenceSumOfOddAndEvenSolution1 ( root ) {
1010 let oddLevelSum = 0 ,
1111 evenLevelSum = 0 ;
1212 let queue = [ root , null ] ;
@@ -26,6 +26,11 @@ function differenceSumOfOddAndEven(root) {
2626 }
2727 return oddLevelSum - evenLevelSum ;
2828}
29+ function differenceSumOfOddAndEvenSolution2 ( root ) {
30+ if ( root == null ) return 0 ;
31+ return root . data - differenceSumOfOddAndEvenSolution1 ( root . leftNode )
32+ - differenceSumOfOddAndEvenSolution1 ( root . rightNode ) ;
33+ }
2934
3035//level - 1
3136let tree = new Node ( 1 ) ;
@@ -60,4 +65,5 @@ tree.rightNode.rightNode.rightNode = new Node(15);
6065// 4 5 6 7
6166// / \ / \ / \ / \
6267// 8 9 10 11 12 13 14 15
63- console . log ( 'Difference sum between odd and even level order ' , differenceSumOfOddAndEven ( tree ) ) ;
68+ console . log ( 'Difference sum between odd and even level order ' , differenceSumOfOddAndEvenSolution1 ( tree ) ) ;
69+ console . log ( 'Difference sum between odd and even level order ' , differenceSumOfOddAndEvenSolution2 ( tree ) ) ;
0 commit comments