From 3183bc4889f7ce21b6059bbbd175f7c84948f7c6 Mon Sep 17 00:00:00 2001 From: Israel Urquiza Date: Tue, 17 Jul 2018 02:55:26 -0700 Subject: [PATCH] fix indentation error in spliceOut method of BinarySearchTree --- .../Binary Search Trees-checkpoint.ipynb | 34 ++++++++----------- Trees/Binary Search Trees.ipynb | 34 ++++++++----------- 2 files changed, 30 insertions(+), 38 deletions(-) diff --git a/Trees/.ipynb_checkpoints/Binary Search Trees-checkpoint.ipynb b/Trees/.ipynb_checkpoints/Binary Search Trees-checkpoint.ipynb index c6679bb0..52269fde 100644 --- a/Trees/.ipynb_checkpoints/Binary Search Trees-checkpoint.ipynb +++ b/Trees/.ipynb_checkpoints/Binary Search Trees-checkpoint.ipynb @@ -17,9 +17,7 @@ { "cell_type": "code", "execution_count": 5, - "metadata": { - "collapsed": false - }, + "metadata": {}, "outputs": [], "source": [ "class TreeNode:\n", @@ -168,14 +166,14 @@ " \n", " self.parent.rightChild = self.leftChild\n", " self.leftChild.parent = self.parent\n", - " else:\n", - " \n", - " if self.isLeftChild():\n", - " \n", - " self.parent.leftChild = self.rightChild\n", " else:\n", - " self.parent.rightChild = self.rightChild\n", - " self.rightChild.parent = self.parent\n", + "\n", + " if self.isLeftChild():\n", + "\n", + " self.parent.leftChild = self.rightChild\n", + " else:\n", + " self.parent.rightChild = self.rightChild\n", + " self.rightChild.parent = self.parent\n", "\n", " def findSuccessor(self):\n", " \n", @@ -249,9 +247,7 @@ { "cell_type": "code", "execution_count": 6, - "metadata": { - "collapsed": false - }, + "metadata": {}, "outputs": [ { "name": "stdout", @@ -283,23 +279,23 @@ ], "metadata": { "kernelspec": { - "display_name": "Python 2", + "display_name": "Python 3", "language": "python", - "name": "python2" + "name": "python3" }, "language_info": { "codemirror_mode": { "name": "ipython", - "version": 2 + "version": 3 }, "file_extension": ".py", "mimetype": "text/x-python", "name": "python", "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.11" + "pygments_lexer": "ipython3", + "version": "3.6.5" } }, "nbformat": 4, - "nbformat_minor": 0 + "nbformat_minor": 1 } diff --git a/Trees/Binary Search Trees.ipynb b/Trees/Binary Search Trees.ipynb index c6679bb0..52269fde 100644 --- a/Trees/Binary Search Trees.ipynb +++ b/Trees/Binary Search Trees.ipynb @@ -17,9 +17,7 @@ { "cell_type": "code", "execution_count": 5, - "metadata": { - "collapsed": false - }, + "metadata": {}, "outputs": [], "source": [ "class TreeNode:\n", @@ -168,14 +166,14 @@ " \n", " self.parent.rightChild = self.leftChild\n", " self.leftChild.parent = self.parent\n", - " else:\n", - " \n", - " if self.isLeftChild():\n", - " \n", - " self.parent.leftChild = self.rightChild\n", " else:\n", - " self.parent.rightChild = self.rightChild\n", - " self.rightChild.parent = self.parent\n", + "\n", + " if self.isLeftChild():\n", + "\n", + " self.parent.leftChild = self.rightChild\n", + " else:\n", + " self.parent.rightChild = self.rightChild\n", + " self.rightChild.parent = self.parent\n", "\n", " def findSuccessor(self):\n", " \n", @@ -249,9 +247,7 @@ { "cell_type": "code", "execution_count": 6, - "metadata": { - "collapsed": false - }, + "metadata": {}, "outputs": [ { "name": "stdout", @@ -283,23 +279,23 @@ ], "metadata": { "kernelspec": { - "display_name": "Python 2", + "display_name": "Python 3", "language": "python", - "name": "python2" + "name": "python3" }, "language_info": { "codemirror_mode": { "name": "ipython", - "version": 2 + "version": 3 }, "file_extension": ".py", "mimetype": "text/x-python", "name": "python", "nbconvert_exporter": "python", - "pygments_lexer": "ipython2", - "version": "2.7.11" + "pygments_lexer": "ipython3", + "version": "3.6.5" } }, "nbformat": 4, - "nbformat_minor": 0 + "nbformat_minor": 1 }