A leftist tree is a min tree satisfying that dist(RChild(i)) $\le$ dist(LChild(i)), where dist(j) denotes the number of edges on the shortest path from node j to a leaf node, RChild(i) and LChild(i) denote the right child and left child of node i, respectively. Which of the following statements about leftist trees are correct?