function  LEM_show_tree(nodes,n)
%

if isempty(nodes)
    return
end

num_nodes = length(nodes);
for k = 1:num_nodes
    [nodes(k).level,nodes(k).name,nodes(k).val,nodes(k).children]
end
return

level = nodes(n).level;
state = nodes(n).name;
children = nodes(n).children;

white = [];
for p = 1:level
    white = [white,BLANK];
end

fprintf('%s',white);
fprintf('[%d]\n',state);

if isempty(children)
    return
end

num_children = length(children);
for c = 1:num_children
    LEM_show_tree(nodes,children(c));
end

