title: substring searching in a string using suffix tree..?
body: <p>I have read that :</p>
  
  <p><strong>Searching for a substring, pat[1..m], in txt[1..n], can be solved in O(m) time (after the suffix tree for txt has been built in O(n) time).</strong> </p>
  
  <p>but at each point, we will have to choose which branch to take, so like in n-ary tree, at each node, we will have to compare with all max n pointers in that node to decide which branch to take. Will this not bring n factor in complexity of this algorithm, somehow in picture</p>
  
  <p>Then how above it says that substring can be found in O(m)?</p>
  
  <p>What am I missing here?</p>