November Challenge

# Problem

Given the `root`

node of a binary search tree, return *the sum of values of all nodes with a value in the range *

.*[low, high]*

It simply calculate the sum for those between the given high and low value.

# Solution I

This is a binary search tree, which means that…

November Challenge

Problem

You are given a **perfect binary tree** where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:

`struct Node {`

int val;

Node *left;

Node *right;

Node *next;

}

Populate each next pointer to point to…