codementor on Nostr: Question: Why not just insert the values one by one, in the array's order, into a ...
Question: Why not just insert the values one by one, in the array's order, into a normal binary search tree?
What tree do you get from 1, 2, 3, 4, 5, 6, 7?
Try to answer before you open the reply.
#tg002 · TG-002-Q3
Published at
2026-10-27 09:07:59 UTCEvent JSON
{
"id": "7c11e70614e0b2763aabd449796cb8712a477c8ab4eefce7b931ba0fa619f64d",
"pubkey": "e68a0856e90d9997b1f721e905249896412dd570399a987b2e8fd5e7fcfe2279",
"created_at": 1793092079,
"kind": 1,
"tags": [
[
"t",
"tg002"
]
],
"content": "Question: Why not just insert the values one by one, in the array's order, into a normal binary search tree?\n\nWhat tree do you get from 1, 2, 3, 4, 5, 6, 7?\n\nTry to answer before you open the reply.\n\n#tg002 · TG-002-Q3",
"sig": "c42a05820c82a298f3a55e31cbc05585b04eaf7b627dcc623ba570c55ef03a4a0ce9b9a39c82e62c7254967a942ec690495e70615ffbf3d6f0631f930aa5684c"
}
