All Questions
4 questions
1
vote
1
answer
374
views
Binary Search Tree insert while keeping track of parent for node to be added - iteration 2
Follow up question to
Binary Search Tree insert while keeping track of parent for node to be added
I am implementing a red black tree for fun and am wondering how I should modify my basic BST insert....
- 125
1
vote
2
answers
673
views
Binary Search Tree insert while keeping track of parent for node to be added
This question has a follow up question:
Binary Search Tree insert while keeping track of parent for node to be added - iteration 2
I am implementing a red black tree for fun and am wondering how I ...
- 125
1
vote
2
answers
665
views
Recursive way to find inorder successor
So far I have attempted to find the inorder successor through recursion and it seems to be working right. Can someone review the code and give suggestions?
...
- 11
7
votes
2
answers
467
views
Lopsided Trees and Recursion
The original problem is:
Define the height of a binary tree to be the number of nodes in the
longest path from the root to a leaf. The empty tree is considered to
have height 0. A node is k-...
- 73