Binary Trees Review | Baamboozle - Baamboozle | The Most Fun Classroom Games!

Team 1
0

Team 2
0

Teams

Name

Score

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

Loading

15

Post order traversal :

1abc*+de*f+g*+

Oops!

Check

Okay!

Check

trap

No points!

Oops!

fairy

Take points!

5

10

15

20

25

shark

Other team loses 20 points!

Okay!

lifesaver

Give 10 points!

Oops!

5

What is the height of the tree?

0

Oops!

Check

Okay!

Check

baam

Lose 25 points!

Oops!

rocket

Go to first place!

Okay!

gift

Win 10 points!

Okay!

thief

Give points!

5

10

15

20

25

15

Preorder Traversal of the tree

1 4 9 8 5 2 3

Oops!

Check

Okay!

Check

15

What are the nodes at depth 2?

[D,E,F,G]

Oops!

Check

Okay!

Check

monster

Reset all scores!

Oops!

rocket

Go to first place!

Okay!

shark

Other team loses 10 points!

Okay!

thief

Give points!

5

10

15

20

25

15

In Order traversal

40 20 50 10 30

Oops!

Check

Okay!

Check

15

What is the MAXIMUM number of nodes in a binary search tree with height = 5 ?

2^(h+1) – 1 => 2^6-1

Oops!

Check

Okay!

Check

10

In array representation of binary tree, if the the data is on ith position what is the position of right child?

2i+1

Oops!

Check

Okay!

Check

10

How many levels would a tree have to have be to contain 32 nodes(with the first level being considered as 0)?

4

Oops!

Check

Okay!

Check

15

Which is not a binary search tree?

B

Oops!

Check

Okay!

Check

15

Add What is the MINIMUM number of nodes in a binary search tree with height = 5?

6

Oops!

Check

Okay!

Check

lifesaver

Give 20 points!

Oops!

magnet

Take 10 points!

Okay!

rocket

Go to first place!

Okay!

baam

Lose 15 points!

Oops!

15

It is the number of edges from the root to the node.

Depth of a Node

Oops!

Check

Okay!

Check

5

How many pair of sibling nodes are in this Tree?

3

Oops!

Check

Okay!

Check

Restart Join for Free

;

Your experience on this site will be improved by allowing cookies.