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 data structure does a binary tree degenerate?
What are linear and non linear data structures?
What are the applications of stack?
What are the scenarios in which an element can be inserted into the circular queue?
What is selection in an algorithm?
What is heap tree explain with example?
What is java priority queue?
List the types of rotations available in splay tree?
Is treemap synchronized?
Can we store a string and integer together in an array?
How does selection sort work?
What is ascii sort order?
What is a list of lists?
What is default size of hashmap?
Explain implementation of traversal of a binary tree.
