Method right_rotate

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

Source from the content-addressed store, hash-verified

38	augment(n), augment(l)
39	void left_rotate(node *n) { rotate(r, l); }
40	void right_rotate(node *n) { rotate(l, r); }
41	void fix(node *n) {
42	while (n) { augment(n);
43	if (too_heavy(n)) {

nothing calls this directly

rotateFunction · 0.85

no test coverage detected