add inverted tree example

Barklim · Barklim · commit b144fc35c3b1 · 2025-03-17T05:20:13.000+03:00
diff --git a/0226-invert-binary-tree.js b/0226-invert-binary-tree.js
@@ -21,3 +21,26 @@ var invertTree = function(node) {
   if (node) [node.left, node.right] = [invertTree(node.right), invertTree(node.left)];
   return node;
 };
+
+// var invertTree = function(root) {
+//   if (root === null) return null;
+
+//   const node = new TreeNode(root.value);
+
+//   node.right = invertTree(root.left);
+//   node.left = invertTree(root.right);
+
+//   return node;
+// };
+
+// var invertTree = function(root) {
+//   if (root == null) return null;
+//   const queue = new Queue([root]);
+//   while (!queue.isEmpty()) {
+//       let node = queue.pop();
+//       [node.left, node.right] = [node.right, node.left];
+//       if (node.left != null) queue.push(node.left);
+//       if (node.right != null) queue.push(node.right);
+//   }
+//   return root;
+// }
diff --git a/example/6.Tree/0226.js b/example/6.Tree/0226.js
@@ -11,17 +11,17 @@
  * @return {TreeNode}
  */
 var invertTree = function(root) {
-    
+
 };
 
-const example1 = invertTree(); // [4,2,7,1,3,6,9] //[ 4,7,2,9,6,3,1]
-const example2 = invertTree(); // [2,1,3] // [2,3,1]
-const example3 = invertTree(); // [] // []
-const example4 = invertTree(); // [1,2,3,4,5,6,7] // [1,3,2,7,6,5,4]
-const example5 = invertTree(); // [3,2,1] // [3,1,2]
+const testCases = [
+    { input: [4,2,7,1,3,6,9], expected: [ 4,7,2,9,6,3,1] },
+    { input: [2,1,3], expected: [2,3,1] },
+    { input: [], expected: [] },
+    { input: [1,2,3,4,5,6,7], expected: [1,3,2,7,6,5,4] },
+    { input: [3,2,1], expected: [3,1,2] }
+];
 
-console.log(example1);
-console.log(example2);
-console.log(example3);
-console.log(example4);
-console.log(example5);
+const results = testCases.map(({ input }) => invertTree(createTreeFromArray(input)));
+var myTreeStringify = JSON.stringify(results, null, 2);
+console.log(myTreeStringify);
