In a complete k-ary tree, every internal node has exactly k children or no child. The number of leaves in such a tree with n internal nodes is: code example

Example 1: Return the Cartesian product of this RDD and another one, that is, the RDD of all pairs of elements (a, b) where a is in self and b is in other.

rdd = sc.parallelize([1, 2])
sorted(rdd.cartesian(rdd).collect())
# [(1, 1), (1, 2), (2, 1), (2, 2)]

Example 2: Write a function called square_odd that has one parameter. Your function must calculate the square of each odd number in a list. Return a Python 3 list containing the squared values Challenge yourself: Solve this problem with a list comprehension!

nums = [square_odds**2 for square_odds in nums if square_odds%2 != 0]