I am trying to build a segment tree but the node structure is not clear can someone please explain the code i found
struct node{
int count;
node *left, *right;
node(int count, node *left, node *right):
count(count), left(left), right(right) {}//what this part is doing please explain and how it affects the complexity of the segment tree as compared to other initialization method
node* insert(int l, int r, int w);};