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

Method left_heavy

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

Source from the content-addressed store, hash-verified

12 inline int height(node *n) const {
13 return n ? n->height : -1; }
14 inline bool left_heavy(node *n) const {
15 return n && height(n->l) > height(n->r); }
16 inline bool right_heavy(node *n) const {
17 return n && height(n->r) > height(n->l); }
18 inline bool too_heavy(node *n) const {

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected