Computer Science, asked by prateekgoel4899, 1 year ago

A binary tree in which if all its levels except possibly the last,have the maximum number of nodes

Answers

Answered by varshneysamyakoxg8tj
1
it is called as complete binary tree if last level is not completed and all other levels are completed if all the levels are completed with each having 2 nodes in full binary tree
Previous Question
Next Question
Similar questions
Business Studies, 7 months ago
Q10. A knowledgeable cook opened a South-Indian Restaurant in Chennai. But the business was not running smoothly and later on he had to close it. What went wrong? एक जानकार रसोइया ने चेन्नई में एक दक्षिण भारतीय रेस्तरां खोला। लेकिन व्यवसाय सुचारू रूप से नहीं चल रहा था और बाद में उसे बंद करना पड़ा। क्या गलत हुआ?. He did not have technical knowledge उसे तकनीकी ज्ञान नहीं था They were too many...
Math, 7 months ago
(b) Headers and Footers​...
Computer Science, 7 months ago
Suniti was typing her project in Writer. She noticed some red wavy lines under a few words. What does this indicates? How can she get rid of these red wavy lines?
English, 1 year ago
what is meaning of denied...
India Languages, 1 year ago
Aap ke mamu ki behen ke sas ke bete ki sas ke pote ki biwi ki sas ka shohar ap ka kon lga...
Chemistry, 1 year ago
Why is the atomic number of an element more important than its atomic mass in a contexts of its properties...
Biology, 1 year ago
Answer of table 13.1 class 11 biology chapter 13...
Physics, 1 year ago
fastening of seat belts is advisable for the safety of persons sitting in a moving car.give reason...