Print the rightmost nodes of a binary tree.

• Traverse the tree in a depth-first manner, starting from the right child of each node.

• Use a queue to keep track of the nodes to be visited.

• Add the rightmost ...read more