15-11-2012, 04:10 PM
EXPRESSION TREE
EXPRESSION TREE.docx (Size: 14.3 KB / Downloads: 24)
Algorithm for Main ()
Step 1: [ INCLUDE NECESSARY HEADER FILES]
Step 2: [READ X]
Step 3:[ CALL EXPTREE(),CALL DISPLAY(), CALL
INORDER(),CALL
PREORDER(),CALL EVALUATE ()]
Algorithm for EXPTREE()
Step 1: Read Character
Step 2: IF Character operator then
CALL PUSH_OP()
Step 3: [IF Character has only numbers]
IF [ is ALnum( str[i] 1 )] THEN
CREATE Newnode
Step 4: Check for ‘ NULL ‘ condition
Step 5: ASSIGN priority
Step 6: IF ( Priority !=0) THEN CALL POP_OP()
Step 7: IF Character = ‘)’ THEN CALL PUSH_OP()