A left-skewed binary tree is a coding pattern where the left side of the tree is more dominant than the right side. Depending on how the programming scheme is represented, a left-skewed binary tree only refers to code that is determined to be height-balanced.
Determining the height balance is relative to the type of programming being used. AVL trees, for example, require the nodes to be equally numbered to mirror each other. Even if there are extra leaves on the left tree, if the height is the same, then it is considered to be a balanced left-skewed binary tree. If the branch includes two or more leaves on one side, as opposed to the other, then it is considered a non-balanced tree.