Graph & Tree - Discrete Structure

In preorder traversal of a binary tree the second step is ____________

• traverse the right subtree

• traverse the left subtree

• traverse right subtree and visit the root

• visit the root

Breadth First Search traversal of a binary tree finds its application in __________

• Cloud computing

• Peer to peer networks

• Weighted graph

• Euler path

The decision tree structure begins at a node called the _____.

• span

• top

• root

• branch

In any undirected graph,the sum of degrees of all nodes

• Must be even

• Must be odd

• is equal the number of edges

• Is twice the number of edges

Let G be a simple undirected planar graph on 10 vertices with 15edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to

• 5

• 6

• 7

• 8

A graph is a collection of

• Row and columns

• Vertices and edges

• Equations

• Childrens and parents

Given a sequence of number below:

50,60,40,70,45,55,30,80,65,35,25,75,85

When creating a binary search tree, what is the height of the tree?

• 3

• 4

• 5

• 6

How many leaf are there in the tree?

• 1

• 3

• 4

• 7

Given a binary search tree, insert 27, 15, 63, 99, 70 and 85 (in this order) into the binary search tree. What is the post-order traversal?

• 5,15,27,34,47,54,63,70,72,75,83,85,88,94,99,101

• 72,54,34,5,27,15,47,63,70,83,75,88,85,101,94,99

• 15,27,5,47,34,70,63,54,75,85,99,94,101,88,83,72

• 15,27,5,47,34,63,54,70,75,85,99,94,101,88,83,72

• none of the above

Determine whether the graph is a bipartite.

• Yes, the graph is a bipartite.

• No, the graph is not a bipartite.