A full binary tree with n non-leaf nodes contains log₂n nodes

A full binary tree with n non-leaf nodes contains n - 1 nodes

A full binary tree with n non-leaf nodes contains 2n nodes

A full binary tree with n non-leaf nodes contains 2n + 1 nodes

A full binary tree with n leaves contains n nodes

A full binary tree with n leaves contains log (n+1) nodes

A full binary tree with n leaves contains 2n - 1 nodes

A full binary tree with n leaves contains 2n nodes

+, -, *, a, b, c, d

a, -, b, +, c, *, d

a, b, c, d, -, *, +

-, a, b, +, *, c, d

left child of the node labelled 30

right child of the node labelled 5

right child of the node labelled 30

left child of the node labelled 10

16

12

6

10