feat: update ts solution to lc problem: No.2096

Author: rain84

solution/2000-2099/2096.Step-By-Step Directions From a Binary Tree Node to Another/README.md

@@ -308,15 +308,13 @@ func getDirections(root *TreeNode, startValue int, destValue int) string {
 
 function getDirections(root: TreeNode | null, startValue: number, destValue: number): string {
     const lca = (node: TreeNode | null, p: number, q: number): TreeNode | null => {
-        if (node === null || node.val === p || node.val === q) {
+        if (node === null || [p, q].includes(node.val)) {
             return node;
         }
         const left = lca(node.left, p, q);
         const right = lca(node.right, p, q);
-        if (left !== null && right !== null) {
-            return node;
-        }
-        return left !== null ? left : right;
+
+        return left && right ? node : left ?? right;
     };
 
     const dfs = (node: TreeNode | null, x: number, path: string[]): boolean => {

solution/2000-2099/2096.Step-By-Step Directions From a Binary Tree Node to Another/README_EN.md

@@ -304,15 +304,13 @@ func getDirections(root *TreeNode, startValue int, destValue int) string {
 
 function getDirections(root: TreeNode | null, startValue: number, destValue: number): string {
     const lca = (node: TreeNode | null, p: number, q: number): TreeNode | null => {
-        if (node === null || node.val === p || node.val === q) {
+        if (node === null || [p, q].includes(node.val)) {
             return node;
         }
         const left = lca(node.left, p, q);
         const right = lca(node.right, p, q);
-        if (left !== null && right !== null) {
-            return node;
-        }
-        return left !== null ? left : right;
+
+        return left && right ? node : left ?? right;
     };
 
     const dfs = (node: TreeNode | null, x: number, path: string[]): boolean => {

solution/2000-2099/2096.Step-By-Step Directions From a Binary Tree Node to Another/Solution.ts

@@ -14,15 +14,13 @@
 
 function getDirections(root: TreeNode | null, startValue: number, destValue: number): string {
     const lca = (node: TreeNode | null, p: number, q: number): TreeNode | null => {
-        if (node === null || node.val === p || node.val === q) {
+        if (node === null || [p, q].includes(node.val)) {
             return node;
         }
         const left = lca(node.left, p, q);
         const right = lca(node.right, p, q);
-        if (left !== null && right !== null) {
-            return node;
-        }
-        return left !== null ? left : right;
+
+        return left && right ? node : left ?? right;
     };
 
     const dfs = (node: TreeNode | null, x: number, path: string[]): boolean => {