https://github.com/cool-pot/pytrees
python3 implementation of trees. Including AVL Tree, Interval Tree and More.
https://github.com/cool-pot/pytrees
avl-tree binary-indexted-tree binary-search-tree interval-tree python3 trie
Last synced: 3 months ago
JSON representation
python3 implementation of trees. Including AVL Tree, Interval Tree and More.
- Host: GitHub
- URL: https://github.com/cool-pot/pytrees
- Owner: cool-pot
- License: mit
- Created: 2018-05-18T16:32:29.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2018-05-21T17:28:36.000Z (about 8 years ago)
- Last Synced: 2025-12-15T14:22:58.440Z (6 months ago)
- Topics: avl-tree, binary-indexted-tree, binary-search-tree, interval-tree, python3, trie
- Language: Python
- Homepage:
- Size: 57.6 KB
- Stars: 9
- Watchers: 1
- Forks: 6
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# pytrees
A collection of python3 implementations of trees. Including AVL Tree, Interval Tree and More.
## Install
~~~ shell
pip3 install pytrees
~~~
## Usage
~~~python
>>> from pytrees import AVLTree, IntervalTree, BinaryIndexTree, Trie
>>> avl = AVLTree.buildFromList([-1,-2,1,2,3,4,5,6])
>>> avl.visulize()
~~~
~~~ bash
-----------------Visualize Tree----------------------
2
-1 5
-2 1 3 6
4
-----------------End Visualization-------------------
~~~
~~~ python
>>> avl.delete(4)
>>> avl.visulize()
~~~
~~~ bash
-----------------Visualize Tree----------------------
2
-1 5
-2 1 3 6
-----------------End Visualization-------------------
~~~
~~~python
>>> avl.insert(0)
>>> avl.visulize()
~~~
~~~ bash
-----------------Visualize Tree----------------------
2
-1 5
-2 1 3 6
0
-----------------End Visualization-------------------
~~~
## Classes
### AVL Tree
AVL Tree.
Balanced Binary Search Tree. Gurantee for balance.
API:
- insert(self, val)
- delete(self, key)
- search(self, key)
- getDepth(self)
- preOrder(self)
- inOrder(self)
- postOrder(self)
- countNodes(self)
- buildFromList(cls, l)
### Interval Tree
Augmented data structure for checking overlaps of intervals. Gurantee for balance.
API:
- queryOverlap(self, val)
- queryAllOverlaps(self, val)
- insert(self, val)
- delete(self, key)
- search(self, key)
- getDepth(self)
- preOrder(self)
- inOrder(self)
- postOrder(self)
- countNodes(self)
- buildFromList(cls, l)
### Binary Search Tree
Simple implementation of Binary Search Tree. No gurantee for balance.
API:
- insert(self, val)
- delete(self, key)
- search(self, key)
- getDepth(self)
- preOrder(self)
- inOrder(self)
- postOrder(self)
- countNodes(self)
- buildFromList(cls, l)
### Trie (Prefix-Tree)
Prefix-tree. Useful for text search.
API:
- insert(self, word)
- search(self, word)
- startsWith(self, prefix)
- findAllWordsStartsWith(self, prefix)
- buildFromList(cls, l)
### Binary Index Tree
A Fenwick tree or Binary Indexed Tree is a data structure that can efficiently update elements and calculate prefix sums in a table of numbers.
API:
- update(self,i,k) --> update value k to index i
- prefixSum(self,i) --> sum up [index 0, index 1, ..., index i]
- preview(self)
- getSize(self)
- buildFromList(cls, l)
Time Complexity: update & prefixSum, O(logN)
Space Complexity: O(N)
## Convention:
- "key" and "val" are almost the same in this implementation. use term "key" for search and delete a particular node. use term "val" for other cases