When representing any algebraic expression E which uses only binary operations in a 2-tree?

The memory address of the first element of an array is called?

The memory address of fifth element of an array can be calculated by the formula?

Which of the following data structures are indexed structures?

How a binary tree can easily be converted into q 2-tree?

What will happen to original binary tree, when converting binary tree into extended binary tree?

What is the pre order transveral when the post order transversal is DEBFCA?