{
  "translations": {
    "en": {
      "av_c1": "Consider searching for the record with key value 32 in this tree. We call the findhelp method with a pointer to the BST root (the node with key value 37).",
      "av_c2": "Check what rt is pointing to. It is not null.",
      "av_c3": "Check the value at the root. We find that it is greater than what we are looking for.",
      "av_c4": "So we want to visit the left child.",
      "av_c5": "We make a recursive call with the left child as the new rt.",
      "av_c7": "So it must be that the root value is less than what we are looking for. So we want to visit the right child.",
      "av_c9": "We make a recursive call with the right child as the new rt.",
      "av_c11": "Check the value at the root. This is the record that we are looking for.",
      "av_c12": "Now we will start unwinding the recursion, passing the record with key value 32 back up to the caller.",
      "av_c13": "Pop the recursion, now rt is back to the node with value 24.",
      "av_c14": "Pop the recursion, now rt is back to the node with value 37.",
      "av_c15": "Pop the recursion one final time to return the record with value 32 back to the original caller of findhelp.",
      "av_c16": "Check the value at the root. We find that it is not greater than what we are looking for.",
      "av_c17": "Check the value at the root. We find that it is not equal to what we are looking for."
    }
  },
  "code": {
    "java": {
      "url": "../../../SourceCode/Java/General/GenTree.java",
      "lineNumbers": false,
      "startAfter": "/* *** ODSATag: GenTreePrint *** */",
      "endBefore": "/* *** ODSAendTag: GenTreePrint *** */",
      "tags": {
        "sig": 2,
        "processNode": 3,
        "checkLeaf": 4,
        "leftChild": 5,
        "checkNull": 6,
        "processChild": 7,
        "getNextSibling": 8,
        "end": 9
      }
    }
  }
}