python dicts are not trees

[robinovitch61]

AFAIK python dicts are not trees, they are hash tables with a deterministic but non-linear probing for resolving collisions.

See here for details: https://just-taking-a-ride.com/inside_python_dict/chapter4.html

[vkarpov15]

When you have nested dicts, you can think of them as trees.

// The metaphor here is that `dict` represents a tree with 3 nodes `nested`, `answer`, and `otherProp`
dict = {"nested":{"answer":42},"otherProp":"test"}

The implementation under the hood isn't particularly relevant here - I'd guess that JS and Ruby also implement their object structures as hash maps internally as well.