Lines Matching refs:tree

12 large binary tree.
23 searching for the word in the tree (using Binary Search), and reporting
24 to the user whether or not it found the word in the tree.
54 into the tree or not. Since "Romeo and Juliet" has thousands of words,
55 trying to examine our binary search tree by hand is completely
56 impractical. Therefore we will write a Python script to search the tree
58 traverses the entire tree searching for a word, and maintaining
59 information about the path from the root of the tree to the current
60 node. If it finds the word in the tree, it returns the path from the
101 binary search tree, put into a Python variable. The second parameter is
103 string representing the path from the root of the tree to our current
107 that needs to contain a node in our search tree. How can we take a
140 high-level overview of what it does. The nodes in our binary search tree were
152 Lines 2-11 of DFS are getting data out of the current tree node and getting
165 pointer is NULL, then the word is not in this tree and we return an empty path
182 is in our tree or not. To actually use it in LLDB on our dictionary program,
240 gets our program variable "dictionary" (which contains the binary search tree)
249 This line initializes the current_path from the root of the tree to our current
250 node. Since we are starting at the root of the tree, our current path starts as
251 an empty string. As we go right and left through the tree, the DFS function
259 find it). We pass in our binary tree stored in the variable root, the word we
264 the path through the tree to the word. So we do
270 From this we can see that the word "Romeo" was indeed found in the tree, and
271 the path from the root of the tree to the node containing "Romeo" is
278 looking for is in the binary tree, and we know exactly where it is in the
279 binary tree. Now we need to figure out why our binary search algorithm is not
452 tree, our search algorithm decided to go right, but our path says the node we
474 node to find the word we are looking for. Let's double check our tree, and see
510    search trees, based on the example search tree defined in
523       Recursively traverse a binary search tree containing
525       word in the tree.  Also maintains a string representing
526       the path from the root of the tree to the current node.
527       If the word is found in the tree, return the path string.
530       This function assumes the binary search tree is
532       functions to examine and traverse the tree nodes.
578       Recursively traverse a binary search tree, counting
579       the nodes in the tree.  Returns the final count.
581       This function assumes the binary search tree is
583       functions to examine and traverse the tree nodes.
600       Recursively traverse a binary search tree, printing out
602       search order for the binary tree).
604       This function assumes the binary search tree is
606       functions to examine and traverse the tree nodes.
665    /* Given a binary search tree (sorted alphabetically by the word at
667       place in the tree.  */
702       binary search tree.  */
725    /* Given a binary search tree and a word, search for the word
726       in the binary search tree.  */
742    /* Print out the words in the binary search tree, in sorted order.  */