Okay, so pick one of the keys and place it as your root node. Then pick one of the other keys and identify every place where it could legally go. Draw a different tree for each possibility. Now add the third key, again identifying every place it can legally go and drawing a new tree for each one.Hi,
Thanks for your interest in my question. Following link shows the binary search tree property:
According to this property value of root node is greater than the value of all nodes in the left sub tree but its value should be less than the values of all nodes in the right subtree.
Kindly guide me with this problem.
Its in the book.When you said that the answer was 15, where did that answer come from?
I found that there are 6 binary trees (2 as '1' as the root, 2 with 2 as a root, and 2 with 3 as a root).How many different binary trees (as opposed to binary search trees) are there?
|Thread starter||Similar threads||Forum||Replies||Date|
|Z||Binary Search Understanding & Running Time calculation line by line||Homework Help||13|
|Z||Search a Binary Search Tree||Homework Help||8|
|Z||Nummber of Comparisons in Binary Search (worst Case)||Homework Help||3|
|C||Binary search Matlab||Programming & Languages||0|
|C||Binary search||Programming & Languages||2|
by Kate Smith
by Jake Hertz
by Ikimi .O
by Jake Hertz