Binary Tree Leaf Counting and Palindrome Check

Aristocrat game services process hierarchical state data and user-facing text validation. Given a binary tree and a string, return both the number of leaf nodes in the tree and whether the string is a palindrome.

Use recursion for the leaf-node count. The palindrome check may use recursion with two indices. Treat the string as case-sensitive and do not ignore spaces or punctuation.

Formal Specification

Implement process_tree_and_string(root, text).

• root is either None or a nested list in the form [value, left, right], where left and right use the same representation.
• text is a string.
• Return a dictionary with keys leaf_count and is_palindrome.
• A leaf is a non-null node whose left and right children are both None.
• An empty tree has zero leaves.
• An empty string is considered a palindrome.