Search & Filtering
The binary search tree shown below was constructed by inserting a sequence of items into a empty tree.
root=5
root->left=3
root->left->right=4
root->right=9
root->right->left=7
root->right->left->left=6
root->right ->left->right=8
root->right->right=12
root->right->right->right=20
Which of the following input sequences will not produce this binary search tree?
1)5 3 4 9 12 7 8 6 20
2)5 9 3 7 6 8 4 12 20
3)5 9 7 8 6 12 20 3 4
4)5 9 7 3 8 12 6 4 20
5)5 9 3 6 7 8 4 12 20
Verify it by doing rough work below others you will get 0 marks.
implementation of the functions of an arrayList
Write the following infix expression into prefix expression :
(((a-g) +(e/b))*c)
Also write each step
constructor overloading.The first constructor which takes no argument is
used to create objects which are not initialized, second which takes one
argument is used to initialize real and imaginary parts to equal values and
third which takes two argument is used to initialize real and imaginary to
two different values.
constructor overloading.The first constructor which takes no argument is
used to create objects which are not initialized, second which takes one
argument is used to initialize real and imaginary parts to equal values and
third which takes two argument is used to initialize real and imaginary to
two different values.
1.Create a class to implement a queue using a circular array
a.The class should contain functions to
i.Insert a new value,
ii.Delete a value.
iii.Change a value equal to X to a value equal to Y.
iv.Count all value equal to X in the queue.
b.For each function above perform an asymptotic analysis and state the worst case performance of the algorithm
Note: No code is required.
Consider the following tree
root=A
root->left=B
root->left->left=C
root->left->left->right=D
root->left->right=E
root->left->right->right=H
root->left->right->left=F
root->left->right->left->right=G
root->right=I
root->right->left=J
root->right->left->left=K
root->right->right=L
root->right->right->right=N
root->right->right->left=M
Task :
Write down the following for the above tree
1)In Order Traversal
2)Pre Order Traversal
3)Post Order Traversal
Note: No code is needed only tree diagram after performing the operations are needed.
Consider the following :
root=5
root->left=3
root->left->right=4
root->left->left=2
root->left->left->left=1
root->right=8
root->right->left=7
root->right->left->left=6
root->right->right=14
root->right->right->right=15
root->right->right->left=13
root->right->right->left=10
root->right->right->left->left=9
root->right->right->left->right=11
Task:
Your task is to Draw the modified Tree diagram under each of the following operations.(Note :the two operations are independant.Each of them starts from the above tree)
a)Deletion of the key with data 4
b)Insertion of the key 16
Note : No global declarations.
Consider following Binary Tree
root=50
root->left=17
root->left->left=12
root->left->left->left=9
root->left->left->right=14
root->left->right=23
root->left->right->right=19
root->right-=72
root->right->right=76
root->right->left=54
root->right->left->right=67
Your task is to write its array representation.
NOTE: No code is required
Consider a BST which is constructed by the following node values(in the given order):
23,15,37,9,20,30,33.
Draw the BST and answer the following questions:
1)Draw BST for above data.
2)How many nodes are requiredto make a full tree?
3)What is the maximum level number of the tree?
4)What nodes are on Level 3?
5)Which nodes(s) has sibling?
