A Question of Some Depth
Let Tbe a k-ary tree, i.e. each internal node of Thas at most kchildren.
Suppose that the depth of Tis d(the maximum depth of any node of Tis
d). What is the maximum number of external nodes (leaves) that Tcan have?
What is the maximum total number of nodes that Tcan have?
The Big Swap
Suppose that xand yare two integer variables. How can I swap the values
of xand ywithout using a third temporary variable?
(The usual way to do this swap is to do something like
temp ←x
x←y
y←temp.
Here we want to avoid using this extra variable. What can we do instead to
achieve this swap?)
1
docsity.com
