Question

How do you do a depth for a search in a tree? Do you remember the traversals of a tree? Pre-order and post order traversals. How do you find traversals? Explain in your own words.

Answer 1

Here i explained all the terms with there example.
MSSM Date Page tree? Do you a tree? Pre-order of post in own wordsa Dues How do you do a deply for a search is a Premember the traversals of ordeu traversals. How do you find traversals? Expbin your to find the depth of a tree DEPTH : The number of edges from to stoot node to of Depth of the called as the leaf node the tree is tree. How to meas wie :- Ce from the root The maximum depth of a tree is the number of nodes to the furthest cleaf node. Example 200t а a (0) 2 2 y 3 ZOUD. Root Depth is always Depth of 10) child = depth of the posant TRAVERSAL OF A TREE It means visiting each made of co tree. exactly once Reading Poussing the data of a OR a node exactly a oncen

classmate Date Page Some order in a tree. st in TYPES ① Breadth First Traversal (hevel Order) ② Depth First Traversal Preorder Traversal Pneuder Traversal Post Order Traversal 3 Pre Order Traversal d <ROOT> <LEFT TREESRIGHT TREES the ht Subtreed b) In this the root node is visited first, then the ne left subtree & finally Example Root 2 € Left Subtree Right subtree Right Explaination: We Btout from A, ß following pre-order Beavenuel we first visit A itself & then move to its reft Subtree B. B is also traversed pre ordero no process gees on until all the nodes are visited. The output of

classmate Date Page 8 pre-order braversal this tree will be on A B D E C F G. (4 Post. Order & Theft Subtree> <Right Subtree> <Root> In this the root node is visited last first we toverse the Left Subhree then the right ht subtree and finally the root node. o Exomple: Root (A 2 B 2G) heft subtree D Right subtree Explaination - We stast from A, ß following post order to vossal first Subtree Bo B is also travery- led post order. The process goes on until all the nodes are visitole the output of post-ordes traversal of this tree will be visit the DE B & G C A

classmate Date Page o WAYS TO FIND TRAVERSALS There are three ways in which we a tree o can traverse ID In-arder Traversal 2 Pre-Orden Traversal 3) Post - Order Traversal & Pre-Order & Post Ouder are explaineda In- Order Javeusal. :-<heftSubhree> <Root><RightSubtes. 6 In this the left fubtree is visited first, then the Moot and later the right sub-tree. We should always remember that may repre- sent a Subtree itself Example every node Root 2 3 heft we move Right - Exploination: We stout fuom A, following in order troversal, to its loft subtree Bo Bie also traversed in- oder. The pro on until all the nodes are visited. The output of in order traversal of this tree will be s- D BE A F C G