code: def _generate_perfect_bst(height):
      
      max_node_count = 2 ** (height + 1) - 1
      node_values = list(range(max_node_count))
      return _build_bst_from_sorted_values(node_values)
docs: Generate a perfect BST (binary search tree) and return its root.
  
      :param height: Height of the BST.
      :type height: int
      :return: Root node of the BST.
      :rtype: binarytree.Node