binarytree Zig canonical optimization

The Zig program for binary tree stores the allocator inside the Node struct.
In a real-world Zig program, one would probably use a global allocator instead , which reduces the struct size significantly and thus should improve performance measurably.