Vibhu Agrawal

> I see, the current implementation in `m_ary_trees.py` doesn't align with the description given [here](https://www.cs.auckland.ac.nz/software/AlgAnim/n_ary_trees.html). It should contain a group of keys but it just contains a single key. A...

So, the node can store the (data, key) as a tuple in a dynamically sized array which can grow up to (m-1) size where m is the maximum number of...

This works. But the array could have been subjected to binary search to search a particular element in that node. However, this won't be possible in the linked list implementation....

I didn't find any specifics about the node size in different applications. So, if you say, I can proceed with a linked list.