In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none
1 2250Traverse 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
1113There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree?
1 2202In the given binary tree, using array you can store the node 4 at which location? 1 2 3 - - 4 - - 5
1 1420What are the types of Collision Resolution Techniques and the methods used in each of the type?
1 1818Draw 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
1679Of 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 1848Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
1 1507Post New Data Structures Questions
What is unhashable type list?
What are the properties of binary tree?
What do you mean by collision in hashing?
What is a simple graph?
A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.
What is the difference between 1d and 2d array?
How to reverse singly link list?
What is data structure what is need of it?
What is difference between hashmap and treemap?
Is arraylist a list?
What is perfect binary tree?
What are the major data structures used in the rdbms?
What is binary tree? Explain its uses.
Which is better stack or queue?
Tell me what is quick sort?