#pragma once

#include <iostream>

#define binNodePos(T) binNode<T>*

#define stature(p) ((p) ? (p)->height_ : -1)

#define IsRoot(x) (!((x).parent_))

#define IsLeftChild(x) (!IsRoot(x) && (&(x) == (x).parent_->left_child_))

#define IsRightChild(x) (!IsRoot(x) && (&(x) == (x).parent_->right_child_))

#define HasParent(x) (!IsRoot(x))

#define HasLeftChild(x) ((x).left_child_)

#define HasRightChild(x) ((x).right_child_)

#define HasChild(x) (HasLeftChild(x) || HasRightChild(x))

#define HasBothChild(x) ( HasLeftChild(x) && HasRightChild(x))

#define IsLeaf(x) (!HasChild(x))

#define Balanced(x) (stature((x).left_child_) == stature((x).right_child_))

#define BalFac(x) (stature((x).left_child_) - stature((x).right_child_))

#define AvlBalanced(x) (-2 < BalFac(x) && BalFac(x) < 2)

#define tallerChild(x) (\

stature((x).left_child_) > stature((x).right_child_) ? (x).left_child_ : ( \

stature((x).left_child_) < stature((x).right_child_) ? (x).right_child_ : ( \

IsLeftChild(x) ? (x).left_child_ : (x).right_child_ ) \

) \

)

template <typename T>

struct binNode {

};