Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/SuprDewd/CompetitiveProgramming
/ tsize
Function
tsize
code/data-structures/cartesian_tree.cpp:6–6 ·
view source on GitHub ↗
Source
from the content-addressed store, hash-verified
4
node(int _x, int _y)
5
: x(_x), y(_y), sz(1), l(NULL), r(NULL) { } };
6
int tsize(node* t) { return t ? t->sz : 0; }
7
void augment(node *t) {
8
t->sz = 1 + tsize(t->l) + tsize(t->r); }
9
pair<node*,node*> split(node *t, int x) {
Callers
2
augment
Function · 0.85
kth
Function · 0.85
Calls
no outgoing calls
Tested by
no test coverage detected