Implement a function that traverses a binary tree to a leaf node and checks if the sum is equal to a particular value. How can this function expand to non-binary trees?
Anonimo
Being able to use recursion (with appropriate end conditions) and talk about inorder/preorder/postorder traversal are definitely plusses.