Content deleted Content added
Reverting edit(s) by 134.117.249.65 (talk) to rev. 1219723315 by Swetha Narayan: Not providing a reliable source (RW 16.1) |
Tag: possible conflict of interest |
||
Line 149:
Notice two points: first, the original tree (<code>xs</code>) persists. Second, many common nodes are shared between the old tree and the new tree. Such persistence and sharing is difficult to manage without some form of [[Garbage collection (computer science)|garbage collection]] (GC) to automatically free up nodes which have no live references, and this is why GC is a feature commonly found in [[Functional programming|functional programming languages]].
===Code===
Githhub repo containing implementations of persistent BSTs using Fat Nodes, Copy-on-Write, and Path Copying Techniques.
To use the persistent BST implementations, simply clone the repository and follow the instructions provided in the README file.
'''Link: ''' https://github.com/DesaultierMAKK/PersistentBST
=== Persistent hash array mapped trie ===
| |||