[Solved] When representing any algebraic expression E the following uses only binary operations in a 2-tree

McqMate

Q.	When representing any algebraic expression E the following uses only binary operations in a 2-tree
A.	the variable in E will appear as external nodes and operations in internal nodes
B.	the operations in E will appear as exter- nal nodes and variables in internal nodes
C.	the variables and operations in E will appear only in internal nodes
D.	None of the above
Answer» A. the variable in E will appear as external nodes and operations in internal nodes

1.2k

0

Do you find this helpful?

5

View all MCQs in

Data Structure and Algorithms (DSA)

Discussion

No comments yet

Related MCQs

When converting binary tree into extended binary tree, all the original nodes in binary tree are
The advantages of linked list over an array for representing a list is________
Which of the following is not the required condition for binary search algorithm
Which of the following is not a limitation of binary search algorithm ?
Which of the following formulas in big-O notation best represent the expression n²+35n+6?
The time complexity of binary search is O(logn).
In strictly binary tree, the out-degree of every node is either o or 2.
A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is
The complexity of Binary search algorithm is
What additional requirement is placed on an array, so that binary search may be used to locate an entry?