Leftist Tree(左偏樹)

Definition

1. A leftist tree is a binary tree such that if it is not empty, then for every internal node x Shortest(left_child(x))>=Shortest(right_child(x))
2. A min-leftist tree (max-leftist tree) is a leftist tree in which the key value in each node is no larger (smaller) than the key values in its children (if any).

Extended Binary tree