UNIT 8

TOPICS TO BE COVERED IN THIS UNIT:

1. Trees- Binary tress
2. Terminology
3. Representation
4. Traversals
5. Graphs- terminology
6. Representation
7. Graph traversals (dfs & bfs)

Beginner Problems

1. Every non-leaf node in a binary tree has filled left & right sub trees in called _______________
2. Tree is of ________________ data structure
4. _________________ tree is a binary tree where all the nodes have two sons excluding the last node.
5. A complete binary tree has all its leaves at the _________________.
6. Find out the total numbers of nodes in complete binary tree
   1. h=3
   2. h=4
   Hint: Total no of nodes N = 2h+1 – 1
7. Passing through every node is called ______________
8. _____________ in which the degree of every node is at most 2
9. In ____________ tree the key value in any node is greater than the key value of its child & its descendant, and less than the key value of its right child and its descendants.


10. Is a _______________ graph


11. The following is a _______________ graph



12. 
    
    

                   _________________           graph                                                                    _________________   graph

13. When the edge, of the graph contain positive values as weight it is known as __________.
14. In Breadth first search we use ________ data structure for traversing the node.
15. In Depth first search we use ________ data structure for traversing the node.
16. A ___________ in a graph is a sequence of vertices {v1, v2, _____ vn} and edge between consecutive vertices
17. A _________ can have more than one edge b/w the same 2 vertices
18. The number of edges, that point to a given vertix in called its __________
19. The number of edges that point from it is called ___________

Intermediate Problems

1. Name different Traversals of a tree?
2. Define full binary Tree?
3. Construct the Binary search tree 7,3,8,1,6,2,9,5
4. Construct the Binary search Tree 48,32,113,140,12,18,35
5. Name different Traversal, in a graph.
6. Find out the Inordr, preorder, postors for the following Trees.
   

Advanced Problems

1. Construct the Adjacency matrix for the following graph
   


2. Construct the Adjacency matrix for the following graphs
   


3. Traverse the graph using Breadth first search.
   


4. Traverse the graph using Depth First search
   

This Page Is Designed By Prudhvi