Register

UGC NET CSE | June 2012 | Part 2 | Question: 27

• edited by
4,288 views

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
1 answer
1
go_editor asked Jul 4, 2016
1,342 views
UGC NET CSE | June 2012 | Part 2 | Question: 8
A binary search tree is a binary tree in which All items in the left subtree are less than root All items in the right subtree are greater than or equal to root Each subtree is itself a binary search tree All of the above
A binary search tree is a binary tree in whichAll items in the left subtree are less than rootAll items in the right subtree are greater than or equal to rootEach subtree...
User Avatar
3 votes
3 votes
2 answers
2
go_editor asked Jul 5, 2016
22,809 views
UGC NET CSE | June 2012 | Part 2 | Question: 50
To represent hierarchical relationship between elements, which data structure is suitable? Dequeue Priority Tree All of the above
To represent hierarchical relationship between elements, which data structure is suitable?DequeuePriorityTreeAll of the above
User Avatar
2 votes
2 votes
2 answers
3
go_editor asked Jul 5, 2016
7,097 views
UGC NET CSE | June 2012 | Part 2 | Question: 49
Which of the following data structure is linear type? Strings Lists Queues All of the above
Which of the following data structure is linear type?StringsListsQueuesAll of the above
User Avatar
2 votes
2 votes
2 answers
4
go_editor asked Jul 4, 2016
3,832 views
UGC NET CSE | June 2012 | Part 2 | Question: 1
The postfix expression AB + CD -* can be evaluated using a stack tree queue linked list
The postfix expression AB + CD -* can be evaluated using astacktreequeuelinked list
User Avatar
Link Copied!