info@avatto.com
+91-9920808017
1. Heap allocation is required for languages
That support recursion
That support dynamic data structure
That use dynamic scope rules
All of above
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
2. A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers?
Preorder
Postorder
Inorder
None of these
3. A character of the data that binary search uses but the linear search ignore, is
Order of the list
Length of the list
The maximum value in the list
The minimum value in the list
4. Which of the following need not to be a binary tree?
Search tree
Heap
AVL-Tree
B-Tree
5. Which of the following need not be a binary tree?
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
