Answer Posted / lomesh ahire
complete binary tree is tree in which all the nodes except
leaf nodes has two childes and all the leaf nodes are at
the same height.atmost complete binary tree is tree in
which all nodes has atmost two childs.
| Is This Answer Correct ? | 28 Yes | 17 No |
Post New Answer View All Answers
What is dynamic array how is it created?
What is hashing in cyber security?
What is binary tree used for?
Differentiate between file and structure storage structure.
How many types of lists are there?
What type of variable is age?
What is the basic of data structure?
What is stack and its operations?
Are linked lists useful?
Which sorting technique is best in worst case?
Which file contains the definition of member functions?
How do you find the complexity of a selection sort?
Why do we need sorting algorithms?
How efficient is binary search?
What is the procedure to insert into a sorted array?
