How many differently shaped n-node binary search trees are possible
Was hoping someone can help me with this problem:
How many differently shaped n-node binary trees are possible? How many differently shaped n-node binary search trees are possible, show by writing a recursive definition?
For part 1 do they mean like full, complete, and balanced? If that is the case then 3
How many differently shaped n-node binary trees are possible? How many differently shaped n-node binary search trees are possible, show by writing a recursive definition?
For part 1 do they mean like full, complete, and balanced? If that is the case then 3
Topic archived. No new replies allowed.