25. A method in a computer for navigating through a representation of a computational construct having zero or more operands, comprising: receiving input from a user; when the received input is a specification of a binary operator, setting the computational construct to be a right operand of the binary operator; and when the received input is a first indicator, setting a current selection to a selection of the representation of a computational construct and its operands in a tree selection type so that when the user inputs a binary operator the computational construct and its operands will be replaced by the binary operator.
25. A method in a computer for navigating through a representation of a computational construct having zero or more operands, comprising: receiving input from a user; when the received input is a specification of a binary operator, setting the computational construct to be a right operand of the binary operator; and when the received input is a first indicator, setting a current selection to a selection of the representation of a computational construct and its operands in a tree selection type so that when the user inputs a binary operator the computational construct and its operands will be replaced by the binary operator. 26. The method of claim 25 wherein the first indicator is a tab.