What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero)
18 52707How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3?
Accenture, Amazon, College School Exams Tests, iGate, Microsoft, TCS, Wipro,
28 78750A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?
12 32227A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?
17 34700When will you sort an array of pointers to list elements, rather than sorting the elements themselves?
5 23100The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered?
11 35865What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest?
19 67431In which data structure, elements can be added or removed at either end, but not in the middle?
42 106907Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements.
22 47348Post New Data Structures Questions
What sorting algorithm does arrays sort use?
Explain how is linked list implemented?
Explain what are the major data structures used in the network data model?
what is a balanced tree.
How many parts are there in a declaration statement?
Can we add heterogeneous elements into treemap?
What are the different types of sorting in data structure?
Explain what is binary search?
How long does it take to master data structures and algorithms?
What is hashing technique? Describe in brief.
Which sort is best for linked list?
State the rules to be followed during infix to prefix conversions?
which is the simplest file structure? (Sequential, indexed, random)
How can a binary tree be represented using the rotation?
Why we need cursor implementation of linked lists?