You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The node.md doc here says “Inner nodes have keys equal to the highest key on their left branch and have values set to nil.”
The mutable_tree.md doc here has a section Set that says inner node key is equal to left child's key
The proof.md doc here seems to draw the tree with keys of inner nodes that have leaf nodes as children as right leaf node’s key and the key of the root (also an inner node) is set to be the key of the left child of the right child of the root. (smallest key in the right subtree)
The code itself here seems to set the inner node to have the key equal to the right child’s key.
The docs should reflect the correct definition of an inner node's key or if there’s a difference between how inner nodes between a mutable tree and an immutable tree are set, that should be documented as well
The text was updated successfully, but these errors were encountered:
The node.md doc here says “Inner nodes have keys equal to the highest key on their left branch and have values set to nil.”
The mutable_tree.md doc here has a section Set that says inner node key is equal to left child's key
The proof.md doc here seems to draw the tree with keys of inner nodes that have leaf nodes as children as right leaf node’s key and the key of the root (also an inner node) is set to be the key of the left child of the right child of the root. (smallest key in the right subtree)
The code itself here seems to set the inner node to have the key equal to the right child’s key.
The docs should reflect the correct definition of an inner node's key or if there’s a difference between how inner nodes between a mutable tree and an immutable tree are set, that should be documented as well
The text was updated successfully, but these errors were encountered: