private void printAll(LeftistTree tree, LeftistTreeNode parent, Node parentNode, int parentPosition, int i) {
        Node p;

        LeftistTreeNode node = tree.root;

        if (node != null && parent == null) {
            p = makeNode(node.value + "<br/>npl: " + tree.npl(node, -1), new Point(parentPosition, getRectNextTop(-1)), Node.COLOR_PARENT, i);
        } else {
            p = parentNode;
        }

        if (tree.top() == null) {
            this.i--;
        }

        if (node != null) {
            recursivePrint(tree, node.left, parentPosition, null, p, i);
            recursivePrint(tree, node.right, parentPosition, null, p, i);
        }
    }