What is complete binary tree in data structure?
- 1 Answers
- 1053 Views
- I also Faced
- E-Mail Answers
Answer / Veerander Kumar Yadav
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled and all nodes are as far left as possible. It can be represented using array.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is weight balanced tree in data structure?
Describe tree database.
Define primary data structures?
Which one is the simplest sorting in data structure?
Which interfaces are implemented by printerstatereasons?
Discuss the difference between a stack and an Array?
Why using cookie to store session info is a better idea than just using session info in the request?
What is the quickest sorting algorithm?
What is time complexity of sorting algorithms?
What is meant by balanced binary tree?
What is data structure geeksforgeeks?
What is Another name of Dynamically allocating memory.
Windows 
