In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none
1 2156Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
1065There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree?
1 2094In the given binary tree, using array you can store the node 4 at which location? 1 2 3 - - 4 - - 5
1 1344What are the types of Collision Resolution Techniques and the methods used in each of the type?
1 1737Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78
1610Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree (b) Complete Binary Tree.
1 1730Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
1 1427Post New Data Structures Questions
Why is data structure important?
How many types of sorting algorithms are there?
Describe what is Node in link list? And name the types of Linked Lists?
Write a program using mergesort technique.
How do you do a mergesort?
Define balance factor of a node in avl tree?
Why is sorting important?
What is height balanced tree?
Does array sort mutate?
What is data structure and data type?
Mention for which header list, you will found the last node contains the null pointer?
State the different types of linked lists?
What is difference between arraylist and linkedlist?
How does quick sort work?
What is space complexity of a program?