×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
Memory address of the first element of an array is known as the ______________________.
2.
Which of the following data structures is linear?
3.
Which of the following data structures permits removing data elements from the front and inserting them at the end?
4.
Which of the following data structures is non-linear?
5.
Which of the following data structures is used to display the hierarchical relationship between elements?
6.
Which of the following gives a sorted list of elements on inorder traversal?
7.
Which of the following data structures makes it easy to validate an arithmetic expression for balanced parentheses?
8.
When starting from the root, which of the following techniques is used to traverse the tree level by level?
9.
In data structures, the tightest lower bound on the number of comparisons for comparison-based sorting is of the order __________.
10.
What is the maximum number of nodes in a binary tree of height h?
Note: Height begins from 0 at the root node.
For example:
1/2 3
Height of this tree is 1. It's not 2.
Note: Height begins from 0 at the root node.
For example:
1/2 3
Height of this tree is 1. It's not 2.