Justin w.

# Trees [What is the minimum possible depth of T]

I just wanna know how can i get the min with certain number of nodes. Who can explain how to find the min

Consider a binary search tree T with 5 nodes.
What is the minimum possible depth of T?

IF  a binary search tree T with 5 nodes.
What is the minimum possible depth of T?

By:

Justin w.

So If a binary search tree T with 15 nodes.

The minimum possible depth of T is 4
because using the formula that you explained
d = ⌈log2 (16)⌉ - 1 => ⌈4⌉ -1=> 4-1 =3 Right!

Is that right?
Report

04/02/16

Roman C.

tutor
The root node is considered as being at depth 0 by most standards. So we can make a depth 3 tree with 15 nodes. It would be a full tree with 1,2,4,8 nodes at depths 0,1,2,3 respectively.
Report

04/02/16

## Still looking for help? Get the right answer, fast.

Get a free answer to a quick problem.
Most questions answered within 4 hours.

#### OR

Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.