Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Data Structures | Tree Traversals | Question 6

Consider two binary operators ‘ ‘ and ‘‘ with the precedence of operator being lower than that of the operator. Operator is right associative while operator is left associative. Which one of the following represents the parse tree for expression (7 3 ­ 4 ­ 3 2)? (GATE CS 2011) (A) A (B) B (C) C (D) D
Answer:(B)
Explanation: Let us consider the given expression (). Since the precedence of is higher, the sub-expression () will be evaluated first. In this sub-expression, would be evaluated first because is right to left associative. So the expression is evaluated as . Also, note that among the two operators, first one is evaluated before the second one because the associativity of is left to right.
Quiz of this Question
Article Tags :
Data Structures
DSA
Recommended Articles
1. Data Structures | Tree Traversals | Question 1
2. Data Structures | Tree Traversals | Question 2
3. Data Structures | Tree Traversals | Question 3
4. Data Structures | Tree Traversals | Question 4
5. Data Structures | Tree Traversals | Question 5
6. Data Structures | Tree Traversals | Question 7
7. Data Structures | Tree Traversals | Question 8
8. Data Structures | Tree Traversals | Question 9
9. Data Structures | Tree Traversals | Question 10
10. Data Structures | Tree Traversals | Question 11
11. Data Structures | Tree Traversals | Question 12
12. Check if given inorder and preorder traversals are valid for any Binary Tree without building the tree
13. Overview of Graph, Trie, Segment Tree and Suffix Tree Data Structures
14. Construct Full Binary Tree from given preorder and postorder traversals
15. Binary Search Tree (BST) Traversals – Inorder, Preorder, Post Order
16. Construct Tree from given Inorder and Preorder traversals
17. Construct a tree from Inorder and Level order traversals | Set 1
18. Construct a tree from Inorder and Level order traversals | Set 2
19. Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
20. Check if given Preorder, Inorder and Postorder traversals are of same tree
21. Merkle Tree and Hash Chain Data Structures with difference
22. Print Postorder traversal from given Inorder and Preorder traversals
23. Preorder from Inorder and Postorder traversals
24. Delete an element from array (Using two traversals and one traversal)
25. Collect maximum points in a grid using two traversals