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
Is null allowed in list?
What is entryset method in map?
Is arraylist a list?
How does quicksort partition work?
Can tuple be sorted?
What is entryset in hashmap?
What is variable size arrays?and why we use it?
What is the difference between array and stack?
What is the best case complexity of quicksort?
why boundary tag representation is used?
Is arraylist synchronized?
Is array of data structure?
How do you find the complexity of a bubble sort?
Can a tree be empty?
Why quicksort is faster than merge sort?
