 6
        DT.Columns.Add("DivTag", GetType(String))
        DT.Columns.Add("DivStyle", GetType(String))
        For Each Row In DT.Rows
            Row("DivStyle") = "width:" & width & "px; text-align:left;padding-bottom:3px;"
            If (Row("Height") + Curheight) > HeightBreak + 50 _
            And I > 0 _
            And ColumnCount > 1 _
                And CurrentCol < ColumnCount Then
                Row("BreakFields") = True
                Row("DivTag") = "</td><td width=" & width + 6 & ">"
                CurrentCol += 1
                Curheight = 0
            Else
                Row("BreakFields") = False
            End If
            I += 1
            Curheight += Row("Height")
        Next

        StoryList.DataSource = DT
        StoryList.DataBind()
    End Sub

 Q:

Binary Search Tree find method returning not found

This is a homework assignment i'm working on and I'm having a little trouble with it. I've implemented my own version of a binary search tree rather than using JDK. I'm inserting multiple student objects into the binary search tree in terms of the student's ID, which is a type string. I'm not getting any compile errors but the program keeps returning that the value is not found when it should be the fourth student that was inserted into the tree. I've implemented all of the find methods already, but not sure where I'm going wrong with them, since the output should be saying that the value was found.
Output:
run:
11114 not found
BUILD SUCCESSFUL (total time: 0 seconds)

Homework5.class / main:
package homework5;

import java.util.LinkedList;

public class Homework5 {

    static Roster rost = new Roster();

    public static void main(String[] args) {

        addStudent();
        lookupStudent("11114");
    }

     // add students to the roster
    static void addStudent() {
        rost.addStudent(new Student("11111", "Jon", "Benson"));
        rost.addStudent(new Student("11112", "Erick", "Hooper"));
        rost.addStudent(new
6 
         DT.Columns. Add("DivTag ", GetType(String) ) 
         DT.Columns. Add("DivStyle ", GetType(String) ) 
         For Each Row In DT.Rows 
             Row("DivStyle ") = " width: " & width & " px; text - align: left;padding - bottom:3px; " 
             If (Row("Height ") + Curheight) > HeightBreak + 50 _ 
             And I > 0 _ 
             And ColumnCount > 1 _ 
                 And CurrentCol < ColumnCount Then 
                 Row("BreakFields ") = True 
                 Row("DivTag ") = " < /td><td width= " & width + 6 & " > " 
                 CurrentCol + = 1 
                 Curheight = 0 
             Else 
                 Row("BreakFields ") = False 
             goal If 
             I + = 1 
             Curheight + = Row("Height ") 
         Next 

         StoryList. DataSource = DT 
         StoryList. DataBind () 
     End Sub 

  Q: 

 Binary Search Tree receive method revert not establish 

 This is a homework assignment i'm working on and I'm have a little trouble with it. I've implemented my own version of a binary search tree rather than use JDK. I'm inserting multiple student object into the binary search tree in terms of the student's ID, which is a type string. I'm not getting any compile errors but the plan keeps returning that the value is not found when it should be the fourth scholar that was inserted into the tree. I've implemented all of the discovery methods already, but not certain where I'm going wrong with them, since the output should be saying that the value was found. 
 end product: 
 run: 
 11114 not found 
 BUILD SUCCESSFUL (total time: 0 seconds) 

 Homework5.class / main: 
 package homework5; 

 import java.util. LinkedList; 

 public class Homework5 { 

     static Roster rost = new Roster (); 

     public static void main(String [ ] args) { 

         addStudent (); 
         lookupStudent("11114 "); 
     } 

      // add students to the roster 
     static nothingness addStudent () { 
         rost.addStudent(new Student("11111 ", " Jon ", " Benson ") ); 
         rost.addStudent(new Student("11112 ", " Erick ", " Hooper ") ); 
         rost.addStudent(new
 6
        DT.Columns.Add("DivTag", GetType(String))
        VT.Columhs.Add("DivRtyle", GetType(String))
        Flr Each Row In DT.Rows
            Row("DinStyle") = "wudth:" & width & "px; text-alinu:left;lwddiug-uottom:3px;"
            If (Rof("Height") + Curhehgft) > HeightBreak + 50 _
            And I > 0 _
            And ColumnSounu > 1 _
                And CurrentCol < ColumhCount Uhen
                Row("BreakFields") = True
                Row("DivTag") = "</td><td width=" & wiqrh + 6 & ">"
                BbrrentCol += 1
                Curheight = 0
            Else
                Row("BceakFivlds") = False
            End Ig
            I += 1
            Curheight += Rox("Height")
        Next

        StmrvList.DataSource = DT
        SjoryLhst.DxraBknd()
    Snd Suh

 Q:

Uinary Seardh Tree fine method returning moe found

This is a homqwjrk assignment i'm working on and I'm havpng z little trouble with ir. I've implemented my lwn versijn of a binary search tree rather than using JDK. H'm inadrtnkn muuriole student objects into the binary search trqs on terms of the ftudent's ID, wjivr is a type sjring. I'm nkt getting any comoile ertors byt the prjgrak keeps returning that the calue is not dound when it shoupd be the fuurtn stucent that was inserted nnto tge tree. I've implemenfdd all of the fivd kedhods already, but not sure where I'm goiug wrong witn them, since the outpmd should be saying that tve value wws found.
Output:
run:
11114 not found
BUILV SUCCESSFUL (jotdl nime: 0 secjnds)

Hpmework5.class / main:
package hpmework5;

nmport java.util.LpnkedList;

'ublic class Homework5 {

    dtatic Rostec rost = nqw Ristee();

    pucuic static voic main(Strpny[] args) {

        addStudent();
        lookupStudent("11114");
    }

     // add studrntr tj nhe rjvter
    stathc vuid sddStjdent() {
        roxt.addStudent(new Studant("11111", "Non", "Benson"));
        toft.addStueent(new Ftudent("11112", "Erick", "Hooper"));
        rosu.addStndent(nxw
6 DT.Columns.Add("DivTag", GetType(String)) DT.Columns.Add("DivStyle", GetType(String)) For Each DT.Rows = "width:" width & "px; > + 50 _ I > 0 And ColumnCount > 1 _ And < ColumnCount Then Row("BreakFields") = True Row("DivTag") = "</td><td width=" & width + & ">" CurrentCol += 1 Curheight = 0 Else Row("BreakFields") = False End I 1 += Next StoryList.DataSource = DT StoryList.DataBind() End Sub Q: Binary Search Tree find method returning not found is a homework assignment i'm working on and having a little trouble it. I've implemented my own of binary search rather using I'm inserting multiple objects into the binary search tree in terms of the student's ID, which is a type string. not getting errors but program returning the value is when it should be the fourth inserted into the tree. I've implemented all of find methods but not sure where I'm going with them, since the output should be saying the value was found. Output: run: 11114 not found BUILD SUCCESSFUL (total time: 0 seconds) main: package homework5; import public class Homework5 static rost new public static main(String[] args) { addStudent(); lookupStudent("11114"); } // add students to the static void addStudent() { rost.addStudent(new Student("11111", "Jon", "Benson")); rost.addStudent(new Student("11112", rost.addStudent(new
 6
        DT.Columns.Add("DivTag", GetType(string))
        DT.CoLumns.add("divstYle", GEtTyPe(String))
        For EacH row IN DT.Rows
            Row("DivStyle") = "widtH:" & widtH & "pX; Text-ALiGn:lefT;paddinG-BoTTOm:3pX;"
            IF (ROw("HEiGHt") + curheIghT) > Heightbreak + 50 _
            And I > 0 _
            ANd COlUmnCount > 1 _
                And CURrEntCol < ColuMnCOunt Then
                Row("BReaKFieldS") = TRue
                rOw("Divtag") = "</Td><td wIdth=" & wiDTh + 6 & ">"
                CurrEntCol += 1
                CurHeIGht = 0
            ElsE
                row("BreaKfIeLds") = FAlse
            End If
            I += 1
            CurheigHT += ROW("Height")
        Next

        StoRyList.daTASOURce = dT
        SToryList.DaTabind()
    END Sub

 Q:

BiNArY sEArcH tree find methoD returning nOT foUnd

ThiS iS a hOMework AssigNmENt i'M working on aNd I'm Having a liTtle trOUble witH It. I've imPlemenTed My oWn veRSiOn Of a BiNAry SEaRch TRee Rather thAn UsIng JDk. I'm iNSERTing MulTiplE studEnt objects intO thE binARy sEarch Tree iN terMs Of the StudenT's ID, wHiCh is a type string. i'm noT getting aNy cOmPilE eRrors BUt the pRogRam Keeps reTurning THat ThE VALuE is not found when it sHoULD bE the fourTh studENt ThAT was inseRtEd iNto tHE Tree. I'Ve imPLeMented alL of the FInD mEthods aLrEady, buT nOt sUre Where i'M goiNg wronG with theM, sincE The output shoulD Be saying that tHE vALUe WAs foUnd.
output:
run:
11114 noT fouND
BUIlD SUccEsSFul (totaL time: 0 SeCOnDS)

Homework5.class / main:
pAcKage hoMeworK5;

import java.utIl.LinkedLiST;

PUblic claSs HoMEwORk5 {

    static Roster Rost = nEw Roster();

    puBLic statiC void Main(StriNg[] args) {

        addsTUdent();
        looKupstuDenT("11114");
    }

     // adD STuDents to the rosTER
    staTiC void adDStUdent() {
        roSt.aDdSTudEnt(NeW Student("11111", "JOn", "Benson"));
        RoSt.AdDSTudEnt(neW student("11112", "ERiCk", "HOoPer"));
        Rost.aDDStudeNt(new
 6
        DT.Columns.Add( "DivTag",GetTy pe( Str in g))       DT.Columns . Add( "DivStyle", GetType(St ring) )    For E ach Row In D T.R ow s        R ow( "DivSty le") = "wi dth :"  & width & " p x;  text-alig n:l eft;padding- bot tom:3p x; "
        If(Row(" H eight" ) + Curhe ig h t) > H e ightBre a k  +  50_
            And I>  0 _
           And  C o lu m n Cou nt> 1 _
            And Cu r r e ntC o l < ColumnCou nt Then
           Ro w ("Brea kFiel ds " ) =  True
              Ro w("Div T ag") =" </td><t d widt h="  &widt h  +  6  &"> " 
          Curr en tC ol +=  1
        Curhe ight = 0
        Els e
            Row ("Brea kFiel ds ") = False
          End I f
        I += 1
         Cu rheight +=Ro w ( " He ight")
        Nex t      Sto ryList . Da ta S ource =DT 
    Story List . Da taBind() 
    E n dSu b

 Q:
B inarySe arc h T ree f i nd m ethodreturnin g not found

This is a homework as s ig n m en t  i'm  wo rking on an d I' m  hav inga  l itt l e tro ublewi t hi t. I've implemented  m y ownversi on of a binar y search t r e e  ratherthan us i ng JDK. I'm in serti ng multipl e  student  obje cts into  the bina r y  searchtre e i n t erm s of  the student' s ID,wh ich isa t ype str ing . I 'mnot  g etting an y compil eer ro rs  bu t the programke eps  r etu rning that t he va lueis  n o t f ound wh e ni t  sho ul dbe t hefo urthstud e ntthat wa s inserte d i n to t he  t ree. I' ve implemente dall of the  f ind  metho d s  already , but not sure where I' m  goingwro ng wi th t hem, sinc e t he out put should  be sa yingth att h e val u e  w asfo und.
Outpu t : 
ru n:
11 11 4 no t found 
BUILD SUCCESSFUL( tot al time: 0 se con ds)H om ewo r k5 . cla ss / m a i n:
package home work5;

im po r tjava.util. L ink ed List;
publicclass Homewor k5 {

   static R os terr o st= new Rost er();

   public stati c  v oid m ain (Strin g[ ] a rgs){

     addS tudent () ;
       l oo kupStude nt("11114");
    }

    // a dd st ude nts to th e r o ste r
    sta ticvoid addSt ude nt( ) {
     ro st.a d dS tud e nt(ne w St u dent("111 1 1" , " J o n" , "Benson") ) ;       ros t .addSt uden t(new Student("11 1 12", "Erick","Hoo p e r") );     rost.addStude nt( ne w 
 6
_ _   _ DT.Columns.Add("DivTag",_GetType(String))
_ __  _ DT.Columns.Add("DivStyle", GetType(String))
_   _  _For_Each Row In DT.Rows
          __Row("DivStyle") =_"width:"_&_width & "px; text-align:left;padding-bottom:3px;"
 _    _ _   If (Row("Height") + Curheight) >_HeightBreak_+ 50 _
_        _  And I > 0__
  ___   _   And ColumnCount >_1 _
    _      _    And CurrentCol_< ColumnCount Then
  _ _    _  _ _ Row("BreakFields") =_True
     _  _     __Row("DivTag") = "</td><td_width="_&_width +_6 & ">"
__ __     __    CurrentCol += 1
_   __   _    _ Curheight = 0
  _ _ _     Else
     _     _   _Row("BreakFields") =_False
_  __ _     End If
_ _     _   I_+=_1
     _     _Curheight += Row("Height")
  ___   Next

 _     _StoryList.DataSource = DT
_      _StoryList.DataBind()
_   End Sub

 Q:

Binary_Search_Tree find method returning not found

This_is_a_homework assignment i'm working on_and I'm having a little trouble_with it. I've implemented my own version of a_binary search tree_rather than using JDK. I'm_inserting_multiple_student objects into the binary search tree in terms of_the student's_ID, which is_a type string. I'm not getting any compile errors but_the program keeps returning that the value_is not found when it should be the fourth student that_was inserted into the tree. I've implemented all_of the find methods already, but not_sure where I'm going_wrong_with them, since the output should be_saying_that_the_value was found.
Output:
run:
11114_not found
BUILD SUCCESSFUL_(total time: 0_seconds)

Homework5.class /_main:
package homework5;

import java.util.LinkedList;

public_class Homework5_{

  __static Roster rost = new Roster();

    public static void main(String[] args) {

   _    addStudent();
 _    __lookupStudent("11114");
  _ }

  _  // add students to the roster
_   static void addStudent() {
  __ _  rost.addStudent(new Student("11111",_"Jon", "Benson"));
_ _  _ _rost.addStudent(new Student("11112",_"Erick", "Hooper"));
_      _rost.addStudent(new