mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-10 11:28:03 +00:00
Updated bst to keep track of its parent and to return the node it inserts.
This commit is contained in:
@@ -38,7 +38,9 @@
|
||||
"* Can we assume all left descendents <= n < all right descendents?\n",
|
||||
" * Yes\n",
|
||||
"* For simplicity, can we use just a Node class without a wrapper Tree class?\n",
|
||||
" * Yes"
|
||||
" * Yes\n",
|
||||
"* Do we have to keep track of the parent nodes?\n",
|
||||
" * This is optional"
|
||||
]
|
||||
},
|
||||
{
|
||||
|
||||
Reference in New Issue
Block a user