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

Given the code below, this method call:

Giok.mewhe();

...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 Giok {
    private int chec;
    private Giok cec;
    private Alles siid;
    private Giok ipat;

    Giok(int chec) {
        this.chec = chec;
    }

    public void setCec(Giok cec) {
        this.cec = cec;
    }

    public void setSiid(Alles siid) {
        this.siid = siid;
    }

    public void setIpat(Giok ipat) {
        this.ipat = ipat;
    }

    public static void mewhe() {
        new Alles(251).kuwli(new Giok(873));
    }

    public void otoc(Alles ral, Giok ecat) {
        int gic = 78;
        ecat.setIpat(this);
        ral.brosm(ecat, gic, new Alles(241));
    }

    public void esslek() {
        Alles.vissne(new Alles(428));
        HERE;
        Alles.nalEsviss(this);
    }

    public void funnil() {
    }
}

public class Alles {
    private int sof;
    private Alles leso;

    Alles(int sof) {
        this.sof = sof;
    }

    public void setLeso(Alles leso) {
        this.leso = leso;
    }

    public void brosm(Giok iset, int ugn, Alles enu) {
        enu.setLeso(this);
        new Giok(325).esslek();
        new Giok(685).funnil();
    }

    public static void nalEsviss(Giok an) {
        Giok mic = new Giok(245);
        Alles nion = new Alles(648);
        Giok scro = new Giok(474);
    }

    public static void gial(Giok swui, Giok eno, Alles fa) {
    }

    public static void vissne(Alles vid) {
    }

    public void kuwli(Giok vi) {
        Alles.gial(vi, new Giok(374), this);
        vi.setSiid(this);
        new Giok(572).otoc(this, vi);
    }
}

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: