discrete mathematics - Proving a binary tree -

discrete mathematics - Proving a binary tree -

how go proving relationship j , k if t binary tree k internal vertices , j terminal vertices

in total binary tee know j = k + 1

in binary tree not total know j = k if there odd number of vertices 1 kid , j = k - 1 if there number of vertices 1 child.

i not sure how go proving process though.

the total number of nodes in finish binary tree of depth d equals 2(d+1) – 1. since leaves in such tree @ level d, tree contains 2d leaves and, therefore, 2d - 1 internal nodes. , can utilize prove other one.

binary-tree discrete-mathematics proof