MCPcopy Create free account
hub / github.com/SuprDewd/CompetitiveProgramming / node

Class node

code/data-structures/avl_tree.cpp:4–8  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

2template <class T>
3struct avl_tree {
4 struct node {
5 T item; node *p, *l, *r;
6 int size, height;
7 node(const T &_item, node *_p = NULL) : item(_item), p(_p),
8 l(NULL), r(NULL), size(1), height(0) { } };
9 avl_tree() : root(NULL) { }
10 node *root;
11 inline int sz(node *n) const { return n ? n->size : 0; }

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected