Binary Trees
$30-75 USD
货到付款
part1. Varios functional manipulations over binary search trees. part2. You will need to implement [url removed, login to view] and [url removed, login to view] in the following manner: [url removed, login to view]: Read in string from the input file and build a binary search tree with them. The input file might have empty lines, and a few words on one line. Prompt a user for a word, check if this word is in the tree. If so, check if this is a leaf. Finally, print a path from the root to this leaf node. [url removed, login to view]: printLevelOrder: Performs a level order traversal on a tree; search: Returns true if a given string is in a tree, otherwise - false; isLeaf: Returns true if a given string is a leaf node, otherwise - false; printPathToLeaf: Given a leaf node in BST. Print a path (sequence of nodes) from the root to this node. split: Use the path connecting the root and this leaf to split the tree into two subtrees, left subtree and right subtree. The method returns an array of two subtrees.
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Use simple codes. It's the first time we are learning binary trees.
## Platform
windows xp
项目ID： #2947040
关于项目
有11名威客正在参与此工作的竞标，均价$50/小时
