DFS -> PostOrder using recursion

Author: nishantml

.ipynb_checkpoints/Searching-checkpoint.ipynb

@@ -127,7 +127,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 48,
+   "execution_count": 54,
    "metadata": {},
    "outputs": [
     {
@@ -141,7 +141,9 @@
       "DFS Inorder uisng recursion -> LVR\n",
       "[1, 4, 6, 9, 15, 20, 170]\n",
       "DES Preorder uisng recursion -> VLR\n",
-      "[9, 4, 1, 6, 20, 15, 170]\n"
+      "[9, 4, 1, 6, 20, 15, 170]\n",
+      "DES Postorder uisng recursion -> LRV\n",
+      "[1, 6, 4, 15, 170, 20, 9]\n"
      ]
     }
    ],
@@ -228,6 +230,9 @@
     "    def DFSPreorder(self):\n",
     "        \"\"\"DES Preorder uisng recursion -> VLR\"\"\"\n",
     "        return traversePreOrder(self.root,[])\n",
+    "    def DFSPostorder(self):\n",
+    "        \"\"\"DES Postorder uisng recursion -> LRV\"\"\"\n",
+    "        return traversePostOrder(self.root,[])\n",
     "\n",
     "            \n",
     "def traverseInOrder(node,InLst):\n",
@@ -251,6 +256,18 @@
     "    if node.right:\n",
     "        traversePreOrder(node.right,PreLst)\n",
     "    return PreLst\n",
+    "\n",
+    "def traversePostOrder(node,PostLst):\n",
+    "    \"\"\"LRV\"\"\"\n",
+    "#     print(node.val)\n",
+    "#     print(PostLst)\n",
+    "    if node.left:\n",
+    "        traversePostOrder(node.left,PostLst)\n",
+    "    if node.right:\n",
+    "        traversePostOrder(node.right,PostLst)\n",
+    "    PostLst.append(node.val)\n",
+    "    \n",
+    "    return PostLst\n",
     "        \n",
     "        \n",
     "bst = BST()\n",
@@ -268,7 +285,9 @@
     "print(bst.DFSInorder.__doc__)\n",
     "print(bst.DFSInorder())\n",
     "print(bst.DFSPreorder.__doc__)\n",
-    "print(bst.DFSPreorder())"
+    "print(bst.DFSPreorder())\n",
+    "print(bst.DFSPostorder.__doc__)\n",
+    "print(bst.DFSPostorder())"
    ]
   },
   {

Searching.ipynb

@@ -127,7 +127,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 48,
+   "execution_count": 54,
    "metadata": {},
    "outputs": [
     {
@@ -141,7 +141,9 @@
       "DFS Inorder uisng recursion -> LVR\n",
       "[1, 4, 6, 9, 15, 20, 170]\n",
       "DES Preorder uisng recursion -> VLR\n",
-      "[9, 4, 1, 6, 20, 15, 170]\n"
+      "[9, 4, 1, 6, 20, 15, 170]\n",
+      "DES Postorder uisng recursion -> LRV\n",
+      "[1, 6, 4, 15, 170, 20, 9]\n"
      ]
     }
    ],
@@ -228,6 +230,9 @@
     "    def DFSPreorder(self):\n",
     "        \"\"\"DES Preorder uisng recursion -> VLR\"\"\"\n",
     "        return traversePreOrder(self.root,[])\n",
+    "    def DFSPostorder(self):\n",
+    "        \"\"\"DES Postorder uisng recursion -> LRV\"\"\"\n",
+    "        return traversePostOrder(self.root,[])\n",
     "\n",
     "            \n",
     "def traverseInOrder(node,InLst):\n",
@@ -251,6 +256,18 @@
     "    if node.right:\n",
     "        traversePreOrder(node.right,PreLst)\n",
     "    return PreLst\n",
+    "\n",
+    "def traversePostOrder(node,PostLst):\n",
+    "    \"\"\"LRV\"\"\"\n",
+    "#     print(node.val)\n",
+    "#     print(PostLst)\n",
+    "    if node.left:\n",
+    "        traversePostOrder(node.left,PostLst)\n",
+    "    if node.right:\n",
+    "        traversePostOrder(node.right,PostLst)\n",
+    "    PostLst.append(node.val)\n",
+    "    \n",
+    "    return PostLst\n",
     "        \n",
     "        \n",
     "bst = BST()\n",
@@ -268,7 +285,9 @@
     "print(bst.DFSInorder.__doc__)\n",
     "print(bst.DFSInorder())\n",
     "print(bst.DFSPreorder.__doc__)\n",
-    "print(bst.DFSPreorder())"
+    "print(bst.DFSPreorder())\n",
+    "print(bst.DFSPostorder.__doc__)\n",
+    "print(bst.DFSPostorder())"
    ]
   },
   {