Register

Recent questions tagged data-structures

2 votes
1 answer
1321
Linked list problem
User Avatar
0 votes
2 answers
1322
Balace Factor Of AVL TREE
Is this an example of AVL Tree ? Here Number of Left Child of Root =4 Number of Right Child of Root =2 Hence Balacing Factor is 2 Hence Not AVL Tree. If so please show me an exaple of AVL Tree with 7 nodes and Height 3. (Height of a tree with single node is 0)
Is this an example of AVL Tree ? Here Number of Left Child of Root =4 Number of Right Child of Root =2 Hence Balacing Factor is 2 Hence Not AVL Tree. If so please show ...
User Avatar
18 votes
3 answers
1323
GATE CSE 1987 | Question: 7b
Construct a binary tree whose preorder traversal is $K\;L\;N\;M\;P\;R\;Q\;S\;T$ and inorder traversal is $N\;L\;K\;P\;R\;M\;S\;Q\;T$
Construct a binary tree whose preorder traversal is$K\;L\;N\;M\;P\;R\;Q\;S\;T$and inorder traversal is$N\;L\;K\;P\;R\;M\;S\;Q\;T$
User Avatar
1 votes
1 answer
1326
BFS traversal
1.{d,c} 2.{d,b} 3.{e,b} 4.{e,f}
1.{d,c}2.{d,b}3.{e,b}4.{e,f}
User Avatar
0 votes
1 answer
1328
Gateforum
Number of comparision in searching an element in a binary search tree is ?
Number of comparision in searching an element in a binary search tree is ?
User Avatar
1 votes
0 answers
1329
Postfix and Prefix
Conver the following infix to Postfix and Prefix $log ( 3 ! )^ {log4} *log log ((6/7)*4+x)!$ $ sin 2x cos (3x+4) $ Please use stack method to solve . Diagram would be appreciated
Conver the following infix to Postfix and Prefix $log ( 3 ! )^ {log4} *log log ((6/7)*4+x)!$$ sin 2x cos (3x+4) $ Please use stack method to solve . Diagram would be app...
User Avatar
0 votes
1 answer
1331
Hashing
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining). 1)What is the probability that the first slot of hash table will be empty?
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining).1)Wh...
User Avatar
19 votes
3 answers
1332
GATE CSE 1987 | Question: 2g
State whether the following statements are TRUE or FALSE: If the number of leaves in a tree is not a power of $2,$ then the tree is not a binary tree.
State whether the following statements are TRUE or FALSE:If the number of leaves in a tree is not a power of $2,$ then the tree is not a binary tree.
User Avatar
31 votes
5 answers
1333
GATE CSE 1987 | Question: 2c
State whether the following statements are TRUE or FALSE: It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given?
State whether the following statements are TRUE or FALSE:It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given?
User Avatar
23 votes
3 answers
1334
GATE CSE 1987 | Question: 1-xv
In a circular linked list organization, insertion of a record involves modification of One pointer. Two pointers. Multiple pointers. No pointer.
In a circular linked list organization, insertion of a record involves modification ofOne pointer.Two pointers.Multiple pointers.No pointer.
User Avatar
1 votes
1 answer
1335
MadeEasy Test Series: Programming & DS - Hashing
Hash table with 6 slots No of keys=8. Collisions are resolved by chaining. Expected no of non empty slots?
Hash table with 6 slotsNo of keys=8.Collisions are resolved by chaining.Expected no of non empty slots?
User Avatar
0 votes
0 answers
1336
Ds+linked list
I am not getting how unsigned is used and how is it working???
I am not getting how unsigned is used and how is it working???
User Avatar
1 votes
1 answer
1337
Which of the following are true ?
User Avatar
0 votes
0 answers
1338
hashing
User Avatar
2 votes
1 answer
1340
binary tree
The height of a binary tree having $`\text{i’}$ nodes at level $`\text{i’}$ considering root to be at level $1$ is __________, where $`n\text{’}$ is the total no. of nodes in the tree. $O(\log n)$ $(O(n)$ $O(\sqrt{n})$ $O(n^{2})$
The height of a binary tree having $ \text{i’}$ nodes at level $ \text{i’}$ considering root to be at level $1$ is __________, where $ n\text{’}$ is the total no. o...
User Avatar
4 votes
2 answers
1341
Heaps
User Avatar
2 votes
1 answer
1344
Madeeasy Test Series
consider a complete binary tree 'T' with key of root node be 'P'. It is given that the left and right subtree of 'P' satisfies the min-heap property. What is the time taken to convert the given tree 'T' to max-heap? a. O(log n) b. O(n) c. O(nlog n) d. O(n2)
consider a complete binary tree 'T' with key of root node be 'P'. It is given that the left and right subtree of 'P' satisfies the min-heap property. What is the time tak...
User Avatar
2 votes
1 answer
1345
BST creation
what is the time complexity in creating a BInary search tree from an unsorted array??
what is the time complexity in creating a BInary search tree from an unsorted array??
User Avatar
0 votes
1 answer
1346
find
A one dimensional array A has indices 1...75.Each element is a string and takes three memory words .The array is stored at location 1120 decimal .The starting address of A[49] is a)1267 b)1134 c)1264 d)1169
A one dimensional array A has indices 1...75.Each element is a string and takes three memory words .The array is stored at location 1120 decimal .The starting address of ...
User Avatar
4 votes
1 answer
1347
GATE Overflow | Data Structures | Test 1 | Question: 30
In a Network where bytes are continuously being transferred, it is required to identify the most frequently transferred byte. What would be an appropriate data structure for finding this? Linked List Array Dynamically growing Array Set
In a Network where bytes are continuously being transferred, it is required to identify the most frequently transferred byte. What would be an appropriate data structure ...
User Avatar
2 votes
2 answers
1349
GATE Overflow | Data Structures | Test 1 | Question: 28
What would be an appropraite data structure to represent family hierarchy where each node is an individual and there in no requirement to keep "married to" relationship? Binary Tree n-ary Tree Graph Linked List
What would be an appropraite data structure to represent family hierarchy where each node is an individual and there in no requirement to keep "married to" relationship?B...
User Avatar
0 votes
3 answers
1350
GATE Overflow | Data Structures | Test 1 | Question: 27
Consider a complete graph of 10 vertices. The minimum no. of edge removals required to make the graph disconnected is ______
Consider a complete graph of 10 vertices. The minimum no. of edge removals required to make the graph disconnected is ______
User Avatar
Page: