sum of nodes method in binary tree using recursion function in JavaScript

Mohammad alshraideh answered on August 12, 2022 Popularity 3/10 Helpfulness 1/10

answer sum of nodes method in binary tree using recursion function in JavaScript

sum of nodes method in binary tree using recursion function in JavaScript

Comment

 sum() {
    let summ= 0
    let traverse = (node) => {
        if (node.left) {
         summ =summ + node.left.data;
          traverse(node.left);
        }

        if (node.right){
          summ =summ + node.right.data;
          traverse(node.right);}
    }
    traverse(this.root);
    summ = summ+this.root.data
    return summ;
  }

//if you find this answer is useful ,
//upvote ⇑⇑ , so can the others benefit also . @mohammad alshraideh ( ͡~ ͜ʖ ͡°)

Popularity 3/10 Helpfulness 1/10 Language javascript

Source: Grepper

Tags: binary-tree function javascript nodes recursion sum using

Link to this answer
Share Copy Link

Contributed on Aug 12 2022

Mohammad alshraideh

0 Answers Avg Quality 2/10

sum of nodes method in binary tree using recursion function in JavaScript

Contents

More Related Answers

sum of nodes method in binary tree using recursion function in JavaScript

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.