give root binary tree integer limit delete insufficient node tree simultaneously return root result binary treeA node insufficient root leaf path intersect node sum strictly limitA leaf node child Example 1input root 12349999789999912139914 limit 1output 1234nullnull789null14example 2input root 54811null17471nullnull53 limit 22output 54811null1747nullnullnull5example 3input root 1235null4null limit 1output 1null34 ConstraintsThe number nod tree range 1 5000105 Nodeval 105109 limit 109