Lines Matching refs:search

41    Enter search word: love
43    Enter search word: sun
45    Enter search word: Romeo
47    Enter search word: ^D
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
101 binary search tree, put into a Python variable. The second parameter is
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
153 ready to do the actual search; lines 12-25 are the actual depth-first search.
162 Otherwise, line 14 checks to see if we should go left (search word comes before
240 gets our program variable "dictionary" (which contains the binary search tree)
279 binary tree. Now we need to figure out why our binary search algorithm is not
282 The idea is as follows. The binary search algorithm has two main decision
452 tree, our search algorithm decided to go right, but our path says the node we
454 search word, we see:
510    search trees, based on the example search tree defined in
523       Recursively traverse a binary search tree containing
530       This function assumes the binary search tree is
552       # Main depth first search
578       Recursively traverse a binary search tree, counting
581       This function assumes the binary search tree is
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
665    /* Given a binary search tree (sorted alphabetically by the word at
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.  */
770    fprintf(stdout, "Dictionary loaded.\nEnter search word: ");
789       fprintf(stdout, "Enter search word: ");