Count of Fibonacci paths in a Binary tree

<script>

    // JavaScript program to count all of
    // Fibonacci paths in a Binary tree
    
    // Vector to store the fibonacci series
    let fib = [];

    // Binary Tree Node
    class node {
        constructor(data) {
           this.left = null;
           this.right = null;
           this.data = data;
        }
    };

    // Function to create a new tree node
    function newNode(data)
    {
        let temp = new node(data);
        return temp;
    }

    // Function to find the height
    // of the given tree
    function height(root)
    {
        if (root == null)
            return 0;

        return (Math.max(height(root.left),
                    height(root.right))
                + 1);
    }

    // Function to make fibonacci series
    // upto n terms
    function FibonacciSeries(n)
    {
        fib.push(0);
        fib.push(1);
        for (let i = 2; i < n; i++)
            fib.push(fib[i - 1] + fib[i - 2]);
    }

    // Preorder Utility function to count
    // exponent path in a given Binary tree
    function CountPathUtil(root, i, count)
    {

        // Base Condition, when node pointer
        // becomes null or node value is not
        // a number of Math.pow(x, y )
        if (root == null
            || !(fib[i] == root.data)) {
            return count;
        }

        // Increment count when
        // encounter leaf node
        if (root.left != null
            && root.right != null) {
            count++;
        }

        // Left recursive call
        // save the value of count
        count = CountPathUtil(root.left, i + 1, count);

        // Right recursive call and
        // return value of count
        return CountPathUtil(root.right, i + 1, count);
    }

    // Function to find whether
    // fibonacci path exists or not
    function CountPath(root)
    {
        // To find the height
        let ht = height(root);

        // Making fibonacci series
        // upto ht terms
        FibonacciSeries(ht);

        document.write(CountPathUtil(root, 0, 0));
    }
    
    // Create binary tree
    let root = newNode(0);
 
    root.left = newNode(1);
    root.right = newNode(1);
 
    root.left.left = newNode(1);
    root.left.right = newNode(4);
    root.right.right = newNode(1);
    root.right.right.left = newNode(2);
 
    // Function Call
    CountPath(root);
  
</script>