Tree height to tree storage capacity ( full tree )

nodes	nodes at this level	total nodes
	2^(n-1)	(2^n)-1
1	1	1
2	2	3
3	4	7
4	8	15
5	16	31
6	32	63
7	64	127
8	128	255

Tree volume to tree height and search comparisons each node stores a value so #of nodes is # of values stored

nodes	minimum height of tree log2 ( nodes +1 )	nodes to search height+1 round up
6	2.8	3
12	3.7	4
25	4.7	5
30	4.9	5
31	5	6
47	5.5	6
74	6.2	7