Siap sedia untuk ke legoland2 Tiket Adult dan 2 Tiket Child - RM 200
bila lagi nak pegi ka...
Thursday, December 27, 2012
Tuesday, December 4, 2012
CSC438 - DATA STRUCTURE - LAB BINARY TREE
package LAB_9_TREE;
class BinaryTreeNode {
int data;
BinaryTreeNode right;
BinaryTreeNode left;
BinaryTreeNode(int a)
{
this.data = a;
}
}
public class BinaryTree {
protected BinaryTreeNode root;
...
prefix and postfix the easy ways
Find the prefix and postfix notation for the
following infix expression:
(a + b – c) * (e / f) – ( g – h/i)
There is a quick way to
convert from one notation to another. You start by inserting all the implicit brackets/parentheses
that determine the order of evaluation, regardless of what notation the
expression is already in. So, taking the expression above and adding these
implicit brackets gives:
...
Subscribe to:
Posts (Atom)
