Interested to Buy Any Domain ? << Click Here >> for more details...
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 the family trees and connection by clause?
Define rehashing?
Why heap sort is not used?
What is height balanced tree?
What is the minimum number of queues needed when implementing a priority queue?
What do you mean by double hashing?
Is binary tree a bst?
What is selection sort with example?
Which time complexity is best?
What is map data structure?
What is the non linear data structure?
Which is the parent class of list
write a program to show the insertion and deletion of an element in an array using the position
What is mean by selection sort?
Explain implementation of traversal of a binary tree.
