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...


There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree?



There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a ful..

Answer / rohit sah

15.

In general:
There are 2n-1 nodes in a full binary tree.
By the method of elimination:
Full binary trees contain odd number of nodes. So there cannot be full binary trees with 8 or 14 nodes, so rejected. With 13 nodes you can form a complete binary tree but not a full binary tree. So the correct answer is 15.

Note: Full and Complete binary trees are different. All full binary trees are complete binary trees but not vice versa.

Is This Answer Correct ?    0 Yes 1 No

Post New Answer

More Data Structures Interview Questions

How does a selection sort work?

0 Answers  


Define secondary clustering?

0 Answers  


Is array a linked list?

0 Answers  


What should be done in the base case for this recursive problem?

0 Answers  


Define threaded binary tree.

0 Answers  


Which is the parent class of hashmap class?

0 Answers  


What is a directed graph?

0 Answers  


Define open addressing?

0 Answers  


How do you declare An array of three pointers to chars

0 Answers  


Is bubble sort adaptive?

0 Answers  


How do you find the time complexity of a bubble sort?

0 Answers  


Describe queue operation.

0 Answers  


Categories