Register

Recent questions tagged data-structures

0 votes
5 answers
1591
What is the level number of an element present in an array of n integers interpreted as a complete binary tree?
If I am given an array $X$ of $n$ distinct integers which is interpreted as a complete binary tree, so if the parent is at index $i$, then it's left child would be at ind...
User Avatar
0 votes
1 answer
1592
What is the no. of nodes in the tree that has exactly one child?
In a binary tree with n nodes every node has an odd no. of descendants. Every node is considered to be its own descendant. What is the no. of nodes in the tree that has exactly one child? (a) 0 (b) 1 (c) (n-1)/ 2 (d) n-1
In a binary tree with n nodes every node has an odd no. of descendants. Every node is considered to be its own descendant. What is the no. of nodes in the tree that has e...
User Avatar
0 votes
6 answers
1594
What is the approach to find preorder from given inorder?
The in-order traversal of a tree resulted in FBGADCE. Then pre-order traversal would result in. a)FGBDECA b)ABFGCDE C)BFGCDEA d)AFGBDEC
The in-order traversal of a tree resulted in FBGADCE. Then pre-order traversal would result in.a)FGBDECAb)ABFGCDEC)BFGCDEAd)AFGBDEC
User Avatar
9 votes
9 answers
1595
ISRO2014-73
How many different trees are there with four nodes $\text{A, B, C}$ and $\text{D}?$ $30$ $60$ $90$ $120$
How many different trees are there with four nodes $\text{A, B, C}$ and $\text{D}?$$30$$60$$90$$120$
User Avatar
2 votes
5 answers
1597
ISRO2008-76
The minimum number of fields with each node of doubly linked list is 1 2 3 4
The minimum number of fields with each node of doubly linked list is1234
User Avatar
0 votes
3 answers
1598
why is the time complexity of operations like isempty, isfull, size, delete stack takes constant time ?
According to me when we perform the above operations we have to traverse the entire list so then why does it all take constant time ?
User Avatar
0 votes
1 answer
1601
Postfix expression for the following image ?
q.26 : I do not understand the output . Why are real , integer and to coming?
q.26 : I do not understand the output . Why are real , integer and to coming?
User Avatar
0 votes
1 answer
1602
How to implement stack using a queue ?
I am unable to understand the implementation of stack using queue , I understood queue implementation using stack but not this one , I searched for a video lecture too but found for implementation of queue only , so plz help in making me this understand .
I am unable to understand the implementation of stack using queue , I understood queue implementation using stack but not this one , I searched for a video lecture too bu...
User Avatar
4 votes
3 answers
1604
UGC NET CSE | June 2014 | Part 2 | Question: 40
What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by $( ( ) \; ( ( ) ) \; ( ( ) ) )$ $2$ $3$ $4$ $5$
What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by$( ( ) \; ( ( ) ) \; ( ( ) ) ...
User Avatar
5 votes
1 answer
1605
UGC NET CSE | December 2013 | Part 2 | Question: 36
How many edges are there in a forest of t-trees containing a total of n vertices ? n + t n – t n ∗ t nt
How many edges are there in a forest of t-trees containing a total of n vertices ?n + tn – tn ∗ tnt
User Avatar
0 votes
3 answers
1606
why do we not apply Binary search for insertion in the heap ?
however number of comparisions in binary search=O(loglogn) and in linear search it is O(logn), time complexity in case of binary search- O(logn) and in case of linear it is also O(logn)
however number of comparisions in binary search=O(loglogn) and in linear search it is O(logn),time complexity in case of binary search- O(logn) and in case of linear it i...
User Avatar
2 votes
2 answers
1608
Preorder to Inorder conversion for binary tree
how to convert into inorder traversal if preorder traversal of binary tree is given in the problem ? exaplain using example.
how to convert into inorder traversal if preorder traversal of binary tree is given in the problem ? exaplain using example.
User Avatar
0 votes
2 answers
1609
Give an algorithm to finding duplicate parenthesis in a expression ?
suppose expression is like : ((a+b)+((c+d))), so how to find duplicate parenthesis in the given expression ?
suppose expression is like : ((a+b)+((c+d))), so how to find duplicate parenthesis in the given expression ?
User Avatar
0 votes
1 answer
1610
Optimal binary search tree
Given the following table of data what are the minimum expected no.of comparisons required for an Optimal i 0 1 2 3 4 Pi 3/16 3/16 1/16 1/16 Qi 2/16 3/16 1/16 1/16 1/16 BST that can be constructed with the given data
Given the following table of data what are the minimum expected no.of comparisons required for an Optimali01234Pi 3/163/161/161/16Qi2/163/161/161/161/16BST that can be co...
User Avatar
0 votes
1 answer
1611
Time com
Consider a binary tree having 'n' elements or 'n' nodes the tree is organized in such a way that at every level 'i' there are 'i' nodes assuming root to be at level 1 the height or depth of binary tree is O(......)
Consider a binary tree having 'n' elements or 'n' nodes the tree is organized in such a way that at every level 'i' there are 'i' nodes assuming root to be at level 1 the...
User Avatar
42 votes
12 answers
1613
GATE CSE 2015 Set 3 | Question: 25
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.
User Avatar
32 votes
4 answers
1614
GATE CSE 2015 Set 3 | Question: 19
Consider the following array of elements. $\langle 89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100 \rangle$ The minimum number of interchanges needed to convert it into a max-heap is $4$ $5$ $2$ $3$
Consider the following array of elements.$\langle 89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100 \rangle$The minimum number of interchanges needed to convert it into a ma...
User Avatar
36 votes
4 answers
1615
GATE CSE 2015 Set 3 | Question: 17
Given that hash table $T$ with $25$ slots that stores $2000$ elements, the load factor $a$ for $T$ is _________.
Given that hash table $T$ with $25$ slots that stores $2000$ elements, the load factor $a$ for $T$ is _________.
User Avatar
25 votes
8 answers
1616
GATE CSE 2015 Set 3 | Question: 13
While inserting the elements $71, 65, 84, 69, 67, 83$ in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is $65$ $67$ $69$ $83$
While inserting the elements $71, 65, 84, 69, 67, 83$ in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is$65$$67$$69$$83$
User Avatar
27 votes
6 answers
1617
GATE CSE 2015 Set 3 | Question: 12
The result evaluating the postfix expression $10 \ 5 + 60 \ 6 / * 8 -$ is $284$ $213$ $142$ $71$
The result evaluating the postfix expression $10 \ 5 + 60 \ 6 / * 8 -$ is $284$$213$$142$$71$
User Avatar
28 votes
1 answer
1619
GATE CSE 2015 Set 1 | Question: 32
Consider a max heap, represented by the array: $40, 30, 20, 10, 15, 16, 17, 8, 4$ ... $40, 30, 20, 10, 35, 16, 17, 8, 4, 15$ $40, 35, 20, 10, 15, 16, 17, 8, 4, 30$
Consider a max heap, represented by the array: $40, 30, 20, 10, 15, 16, 17, 8, 4$.$$\begin{array}{|l|l|}\hline \text{Array index} & \text{1} & \text{2} & \text{3} & \...
User Avatar
Page: