Answer Posted / parveen
a tree is sed to be a cbt if each node except leaf node has
two childrens
| Is This Answer Correct ? | 3 Yes | 8 No |
Post New Answer View All Answers
Please Help Members By Posting Answers For Below Questions
What is the difference between array and list?
What is a hash index?
What are splay trees?
What is the meaning of anonymous array? Explain with an example?
What is difference between rb tree and avl tree?
Name the areas in which you can apply data structures extensively?
Which sort is best for linked list?
What is a concurrenthashmap?
What are the basic operations of stack?
Describe binary tree and its property.
Describe queue operation.
Define back edge?
Can you list out the areas in which data structures are applied extensively?
Can value be null in treemap?
Why is hashmap used?
