sorted or unsorted binary tree?
1. For sorted binary tree: Use binary tree search algorithm to find the input number;
2. if it's unsorted, you got to use binary tree traversal algorithm to find the node;
3. Use delete node function to remove the found node.
They are standard tree operations, your kid could use google to find the code for java, don't do it from scratch.
回复:女儿(high school)作业的一部分.她programmed了一天
所有跟帖:
•
my daughter just read your answer, thank you
-BETHDA-
♀
(0 bytes)
()
10/18/2009 postreply
18:03:47