**Keep visiting this site and link. Same links will be updated with time**
““““““““““““““““““““““““““““““““““““““““`
PAPER 1:
Question No: 1
Queue, Array sum valid or invalid,
Question No: 2
post-order in-order ,pre-order binary tree
Question No: 3
Deleting step in BST assume in-order traversal
Question No: 4
Pointer using in Linked list give reason
Queue, Array sum valid or invalid,
Question No: 2
post-order in-order ,pre-order binary tree
Question No: 3
Deleting step in BST assume in-order traversal
Question No: 4
Pointer using in Linked list give reason
PAPER 2:
How can we identify an avl tree…3marks
Consider the following AVL tree.Insert new node (87) in this tree and make tree balance.
Draw a binary tree of node 4.
