Professional Documents
Culture Documents
1. Apply your understanding to explain about binary search tree and draw the
binary search tree for the following input list 60, 25,75,15,50,66,33,44.
Trace an algorithm to delete the nodes 25, 75, 44 from the tree.
2. Conclude the types of tree traversal methods(bfs, dfs)? Explain it with
example and deduce a routine for each of them.
3. Illustrate your understanding by finding the inorder, preorder and postorder
form for the following graph:
4. Formulate the term binary search tree and do the following operations. i)
Show the result of inserting 3,1,4,6,9,2,5,7 into an initially empty binary
search tree. ii) Show the result of deleting the root.