Puzzle 20140320634694

Puzzle Home

Make everything smaller

Make everything bigger

Solution

		1
2


	3				4
												5

										6
					O		7


					8


						9				10					11 K

						12											13

												14
								15						D

Across:

2.	an arrangement of the elements of a set
3.	the number of vertices in a 3-ary tree with two internal vertices
8.	A simple graph is connected iff it has a ______ tree

10.	connected undirected graph with no cycle
12.	a vertex that has children
15.	any vertex that has an ancestor

Down:

1.	listing of a vertices of a tree
4.	one of many applications of trees
5.	vertices with the same parents
6.	the branch of mathematics dealing with combinations of objects belonging to a finite set in accordance with certain constraints
7.	A rooted tree whose internal vertices have no more than two children

9.	largest level of the vertices of a tree
11.	an algorithm for consructing a minimum spanning tree
13.	subgraph of a tree rooted at A consisting of A and its descendants
14.	a vertex that has no child

© 2014 PuzzleFast.com, Noncommercial Use Only

1

T

2

P

E

R

M

U

T

A

T

I

O

N

A

V

3

S

E

V

E

4

N

R

E

5

S

S

T

I

A

W

6

C

B

L

O

7

B

O

L

R

I

M

I

K

N

B

N

8

S

P

A

N

N

I

N

G

R

N

S

Y

A

9

H

10

T

R

E

E

11

K

E

O

R

12

I

N

T

E

R

N

A

L

U

13

S

G

I

S

U

H

C

14

L

K

B

T

15

D

E

S

C

E

N

D

A

N

T

A

L

R

F

E

E

Across:

2.	an arrangement of the elements of a set
3.	the number of vertices in a 3-ary tree with two internal vertices
8.	A simple graph is connected iff it has a ______ tree

10.	connected undirected graph with no cycle
12.	a vertex that has children
15.	any vertex that has an ancestor

Down:

1.	listing of a vertices of a tree
4.	one of many applications of trees
5.	vertices with the same parents
6.	the branch of mathematics dealing with combinations of objects belonging to a finite set in accordance with certain constraints
7.	A rooted tree whose internal vertices have no more than two children

9.	largest level of the vertices of a tree
11.	an algorithm for consructing a minimum spanning tree
13.	subgraph of a tree rooted at A consisting of A and its descendants
14.	a vertex that has no child

© 2014 PuzzleFast.com, Noncommercial Use Only