-
@BriungRi @davidiw @movekevin @vgao1996 @wrwg
Presently, the Aptos Framework and Move/Aptos Standard libraries include assorted vector and map collections, but no set implementations. The followin…
-
I am having difficulty defining an AVL tree using Stainless. In Liquid Haskell, I can define AVL using the following code:
```haskell
-- | Trees with value less than X
{-@ type AVLL a X = AVL {v:…
-
![avl_tree_rebalancing svg](https://cloud.githubusercontent.com/assets/12219300/19878840/8010aa24-9faa-11e6-9de5-70b328dfd32d.png)
https://upload.wikimedia.org/wikipedia/commons/thumb/f/f5/AVL_Tr…
-
Recursive functions violate MISRA C:2012 rule 17.2.
We have three recursive functions that can be found by searching for `-no-recursion`, all of them performing tree traversal:
- `rxFragmentDest…
-
```
To reduce the height of the binary tree, a bunch of trees are created, one for
each bucket of a hash table. How this works needs to be documented otherwise
it will be hard for others to hack th…
-
Thanks for your port! I am happily using it (building it from source) but noticed that the instructions don't work for a recent Ubuntu because there is no package available.
Would be great to build…
-
Hey @ossamamehmood
I can add the implementations of BST, AVL and Red Black in C language.
Do assign this to me under Hacktober tag.
I'll finish it ASAP.
Thank you
Happy Coding!
-
I input the data 10, 4, 6. After the rebalance, the height of each of the three nodes should be ZERO. However, in your AVL tree code, the height isn't ZERO. You can check it.
-
**Describe the bug**
The exercise says that the 12 should be deleted, but when you scroll down to that step, it shows that the 11 should be deleted.
![image](https://user-images.githubusercontent.co…
-
I would love to see self balancing Binary Search Tree data structure with generics support. Ready to start working on it as long as it is OK. Here I have a draft version written for my own library. Sh…