Boolean expression:0 false1 true2 OR||3 AND&&4 XOR ^5 NOT !Binary Tree:3 (F)/ \5(F) 4(F)/ / \2(T) 1 1/ \1 0current result = falsedesired result: trueIn one operation, you can flip any leaf.Return the minimum number operations that need to be done such that evaluation of root yields desired result.3 (T)/ \5(T) 4(T)/ / \2(F) 1 0 1/ \1 0 0return 2dp➕二叉树遍历 真有意思🤔