zig: stack alloc recursive data structure

gistfile1.txt

const std = @import("std");

const Node = struct {
    left: ?*Node = null,
    right: ?*Node = null,

    pub fn new(allocator: *std.mem.Allocator) !Node {
        return Node{
            .left = try allocator.create(Node),
            .right = try allocator.create(Node),
        };
    }
};

pub fn main() !void {
    var buf: [65536]u8 = undefined;
    var buffer = std.heap.FixedBufferAllocator.init(&buf);

    var node = try Node.new(&buffer.allocator);

    std.debug.print("{}\n", .{node});
}