Skip to main content

Home/ Mac Attack/ Group items tagged binary tree

Rss Feed Group items tagged

Filter: All | Bookmarks | Topics Simple Middle
Benjamin Bandt-Horn

Binary Search Tree library in Python | Laurent Luce's Blog - 0 views

www.laurentluce.com/...-search-tree-library-in-python

binary tree python

shared by Benjamin Bandt-Horn on 27 Dec 13 - No Cached
  • This article is about a Python library I created to manage binary search trees. I will go over the following: Node class Insert method Lookup method Delete method Print method Comparing 2 trees Generator returning the tree elements one by one
  • https://laurentluce@github.com/laurentluce/python-algorithms.git
  • binary search tree
  • ...5 more annotations...
  • Delete method
  • There are 3 possibilities to handle: 1- The node to remove has no child. 2- The node to remove has 1 child. 3- The node to remove has 2 children.
  • look for its successor by going right then left until we reach a leaf
  • if node is None:
  • ‘A’ < ‘B’ is True in Python.
  • Benjamin Bandt-Horn on 27 Dec 13
     
    This article is about a Python library I created to manage binary search trees. I will go over the following: Node class Insert method Lookup method Delete method Print method Comparing 2 trees Generator returning the tree elements one by one
Benjamin Bandt-Horn

Binary Tree in Python - Stack Overflow - 0 views

stackoverflow.com/...binary-tree-in-python

binary tree python

shared by Benjamin Bandt-Horn on 27 Dec 13 - No Cached
  • def PreOrder(self): print self.data if self.left: print self.left.PreOrder() if self.right: print self.right.PreOrder()
1 - 2 of 2
Showing 20▼ items per page