Answer Posted / tadveer verma
a tree which has atmost two child is called a binary tree.
| Is This Answer Correct ? | 3 Yes | 3 No |
Post New Answer View All Answers
Which is the simplest file structure?
Define open addressing?
What are the classification of data structures?
What is bubble sort algorithm in data structure sort and searching?
What is array indexing?
What is bubble sort technique?
Name few collections map implementations?
What is dynamic data structure?
What is a b+ tree? Explain its uses.
Which collection type is used to maintain uniqueness of data structure?
What is the best case complexity of bubble sort?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
List the basic operations carried out in a linked list?
What are the disadvantages of sequential storage?
What is a treemap chart?
