In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none
1 2172Traverse 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
1071There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree?
1 2108In the given binary tree, using array you can store the node 4 at which location? 1 2 3 - - 4 - - 5
1 1352What are the types of Collision Resolution Techniques and the methods used in each of the type?
1 1744Draw 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
1621Of 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 1751Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
1 1439Post New Data Structures Questions
Can we put null key in hashmap?
What is the difference between list and arraylist?
Why do we use data structures?
Which is faster arraylist or linked list?
What do you mean by 2-3-4 tree?
Describe what is Node in link list? And name the types of Linked Lists?
What is stack in data structure with the example?
An array having 100 elements have numbers from 1 to 99 randomly out of which any number is repeated. Find the repeated number in minimum time and space complexity.
Define shortest path?
Tell me why can't constant values be used to define an array's initial size
Which sorting is best and why?
What is a stable sort?
Does treemap allow null values?
Are duplicates allowed in hashmap?
What is ascending and descending order?