lib/arith_expr_ast_eval/btree.rb
#
# left node, right node - Node here
#
left node, right node - Node here
left node right node - Node here
def add_l(node)
      @root.lnode = node
      @node_count += 1
      self
    end
def add_l ( node ) @root . lnode = node @node_count += 1 self end
left node, right node - Node here
left node right node - Node here
node
<not_specific>