Draw this graph as a search tree with k at the top and witho

Draw this graph as a search tree with k at the top and without having the same node in a branch more than once. Order nodes at each level alphabetically left-to-right.

Solution

                    k

              E           P

          D      F

       B

As shown in above diagram K node at the top and all nodes are represented in a tree such that if we traverse the tree in preorder way we get the nodes in alphabetical order.

A         C