Download Android App in your Android Device from Google Play Store
- Search for "Withoutbook Practice Exam Test" in Mobile/Tablet Play Store
Practice InterviewNew Search by Name or Email

Exams Attended

Make Homepage

Bookmark this page

Subscribe Email Address

Data Structures Interview Questions and Answers

Ques 16. In an AVL tree, at what condition the balancing is to be done?

Ans. If the pivotal value (or the Height factor) is greater than 1 or less than 1.

Is it helpful? Add Comment View Comments
Ques 17. Minimum number of queues needed to implement the priority queue?
Ans. Two. One queue is used for actual storing of data and another for storing priorities.
Is it helpful? Add Comment View Comments
Ques 18. How many different trees are possible with 10 nodes ?
Ans. 1014 - For example, consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 23 - 3 =? 5) trees.
Is it helpful? Add Comment View Comments
Ques 19. What is a node class?
Ans. A node class is a class that, relies on the base class for services and  implementation, provides a wider interface to users than its base class, relies primarily on virtual functions in its public interface depends on all its direct and indirect base class can be understood only in the context of the base class can be used as base for further derivation
can be used to create objects. A node class is a class that has added new services or functionality beyond the services inherited from its base class.
Is it helpful? Add Comment View Comments
Ques 20. When can you tell that a memory leak will occur?
Ans. A memory leak occurs when a program loses the ability to free a block of dynamically allocated memory.
Is it helpful? Add Comment View Comments

Most helpful rated by users:

©2020 WithoutBook