def get_full_binary_tree_leaves(height):
return <NUM_LIT:2> ** height<EOL>
Calculate the number of leaves in a complete binary tree in which each internal
node has exactly two children. A full binary tree is complete if every leaf
in the tree has the same depth. A leaf is a node without children

Args:
    height: integer, the height of the tree. Height is defined by the number
    of edges from the furthest child to the root. An edge is the line segment
    that runs between and connects nodes.