Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


Define ancestor and descendant ?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Data Structures Interview Questions

What is a graph?

3 Answers  


What are the different binary tree traversal techniques?

0 Answers  


Why is arraylist used?

0 Answers  


What is the time complexity of selection sort?

0 Answers  


how to search an element in sorted linked list with time complexity is O(log n).

3 Answers   Wipro,


Can you have an arraylist of arrays?

0 Answers  


How do you declare An array of three char pointers

0 Answers  


Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree (b) Complete Binary Tree.

1 Answers  


How do I sort hashset?

0 Answers  


How efficient is binary search?

0 Answers  


How memory is reserved using a declaration statement ?

0 Answers  


ple.. briefly describe the purpose of having a base case and a recursive case in a recursive algorithm

2 Answers  


Categories