Stack frames and objects (like the Idea Lab activity): Correct Solution

Given the code below, this method call:

Mehes.harPacin();

...will eventually reach the point marked HERE. Draw a diagram of the stack and the heap at that point.

(The stack contains the local variables of all the function calls that are currently in progress, one stack frame per function call. The heap contains all of the objects that currently exist.)

In your diagram:

Label each stack frame with the name of the method.
Label each object with the name of its class.
Include the names of all the variables that belong to each object and stack frame, including the implicit this parameter if present. (You do not need to write the types of any variables.)
When a variable's value is null or a primitive, write the value immediately next to the variable.
When a variable points to an object, draw an arrow from the variable to the object it points to.

The code:

public class Mehes {
    private int iel;
    private Mehes qin;
    private Mehes edon;

    Mehes(int iel) {
        this.iel = iel;
    }

    public void setQin(Mehes qin) {
        this.qin = qin;
    }

    public void setEdon(Mehes edon) {
        this.edon = edon;
    }

    public void tapess() {
        int bu = 97;
        Mehes nago = new Mehes(815);
        int scoc = 50;
    }

    public void sepe() {
        int aerd = 39;
        int biqi = 16;
    }

    public void sucic(int toic, Onbre ene) {
        Onbre lera = new Onbre(75);
    }

    public static void harPacin() {
        Onbre.eught(new Mehes(264), new Mehes(279), new Onbre(840));
        Onbre.pehor(23, new Onbre(615));
    }
}

public class Onbre {
    private int idot;
    private Onbre eou;
    private Onbre pi;

    Onbre(int idot) {
        this.idot = idot;
    }

    public void setEou(Onbre eou) {
        this.eou = eou;
    }

    public void setPi(Onbre pi) {
        this.pi = pi;
    }

    public void prere(int dusm, Mehes senk) {
        int toin = 17;
        senk.setQin(senk);
        this.henva(dusm, toin, new Onbre(743));
        this.esmTiva(dusm, this, senk);
    }

    public static void histdo(int gesm, Onbre efun, Onbre frun) {
        Mehes roum = new Mehes(954);
        new Mehes(161).tapess();
        HERE;
    }

    public static void eught(Mehes iam, Mehes acir, Onbre ii) {
        Onbre rund = new Onbre(908);
        Mehes alal = new Mehes(972);
        new Mehes(344).sepe();
    }

    public static void pehor(int girf, Onbre nume) {
        nume.setEou(nume);
        nume.prere(girf, new Mehes(370));
        new Mehes(118).sucic(girf, nume);
    }

    public void henva(int elu, int urot, Onbre ves) {
        Onbre jeng = new Onbre(745);
        this.setEou(jeng);
        Onbre.histdo(urot, ves, this);
    }

    public void esmTiva(int lepi, Onbre gua, Mehes suou) {
        Mehes cead = new Mehes(639);
    }
}

Solution

Hints for practicing this puzzle:

Practice with difficulty 0, then work your way up. This will help you get a handle on what the puzzle is asking.
There is only one path through the code from the starting method call to HERE. Start by finding that path.
Be thorough. Double check that you've fully diagrammed each step before you move on to the next one.
You can feed this code into https://pythontutor.com and watch a diagram like this build up step by step. (Yes, despite the web site's name, it also works with Java.)

Related puzzles: