I thought of a brute force approach but did not work.
For each character, I tested two possibilities:
1. Being a leaf (the leftmost node) and the next character is the root of a
subtree.
2. Be the root of a subtree.
After testing all possible sums!
Wladimir Araujo Tavares
*Federal University
Hi guys,
Can anyone help me solve this (I mean explain to me how to solve it):
The following text is an in-order traversal of a binary tree with 1023
nodes. What is the sum of the digits appearing in the leaves?
bDq4i3eFNmjh2oMgjNsIFkRWsonRl=tz9kf8gOpED2gVQrfx49GjR9/
QNqTEJkSzM30p4RfneDc7EmdusIYd
