For any node $n$ of a binary searching tree it holds that

$|h(n.$ left $)-h(n.$ right $)|1$

for the height $h$ of the two subtrees $n.$ left and $n.$ right of $n.$

True

False