In computer science, a self-balancing binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.

A self-balancing scooter (also hoverboard, self-balancing board, segway, swegway or electric scooter board) is a self-balancing personal transporter consisting of two motorized wheels connected to a pair of articulated pads on which the rider places their feet.