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

Given the code below, this method call:

Sidcu.biur();

...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 Sidcu {
    private int ced;
    private Har za;
    private Har de;
    private Sidcu osh;
    private Sidcu pid;

    Sidcu(int ced) {
        this.ced = ced;
    }

    public void setZa(Har za) {
        this.za = za;
    }

    public void setDe(Har de) {
        this.de = de;
    }

    public void setOsh(Sidcu osh) {
        this.osh = osh;
    }

    public void setPid(Sidcu pid) {
        this.pid = pid;
    }

    public static void biur() {
        Har mawe = new Har(459);
        int adjo = 75;
        int sa = 81;
        Har eni = new Har(228);
        new Sidcu(227).sidcas(sa, mawe);
        eni.insmel(adjo, mawe);
        eni.iasde(new Har(857), adjo, mawe);
    }

    public static void couc(Sidcu feng, int ma) {
        Har isme = new Har(684);
        feng.setZa(isme);
        feng.cebia();
    }

    public static void dessor(Har rol, int veo, Har ahen) {
        Sidcu.couc(new Sidcu(966), veo);
    }

    public void cebia() {
        HERE;
    }

    public void sidcas(int ces, Har tro) {
        Sidcu arei = new Sidcu(434);
        Sidcu seca = new Sidcu(372);
        new Har(529).cien(ces);
    }

    public static void amming(Har deu, Har da, Har ro) {
        Sidcu skir = new Sidcu(359);
    }
}

public class Har {
    private int olk;

    Har(int olk) {
        this.olk = olk;
    }

    public void toii(int giri, Har ho, Har iski) {
    }

    public void iasde(Har bi, int ga, Har pe) {
        Sidcu.amming(this, pe, bi);
    }

    public void cuphi() {
        int wibo = 42;
        Sidcu jor = new Sidcu(954);
        Sidcu wiie = new Sidcu(792);
        int ches = 84;
    }

    public void insmel(int oalo, Har ki) {
        ki.cuphi();
        Sidcu.dessor(new Har(912), oalo, this);
        ki.toii(oalo, ki, new Har(263));
    }

    public void cien(int hess) {
    }
}

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: