// succ returns the in-order successor of node v.
succ returns the in-order successor of node v.
// succ returns the in - order successor of node v .
func (t *binTree) succ(v uint32) uint32 {
	if v == null {
		return null
	}
	u := t.min(t.node[v].r)
	if u != null {
		return u
	}
	for {
		p := t.node[v].p
		if p == null {
			return null
		}
		if t.node[p].l == v {
			return p
		}
		v = p
	}
}
func ( t * binTree ) succ ( v uint32 ) uint32 { if v == null { return null } u := t . min ( t . node [ v ] . r ) if u != null { return u } for { p := t . node [ v ] . p if p == null { return null } if t . node [ p ] . l == v { return p } v = p } }
succ returns the in-order successor of node v.
succ returns the in - order successor of node v .