New tutorial: // This example is a variant of hsimple.C but using a TTree instead // of a TNtuple. It shows : //   -how to fill a Tree with a few simple variables. //   -how to read this Tree //   -how to browse and analyze the Tree via the TBrowser and TTreeViewer // This example can be run in many different ways: //  way1:  .x tree1.C    using the CINT interpreter //  way2:  .x tree1.C++  using the automatic compiler interface //  way3:  .L tree1.C  or .L tree1.C++ //          tree1() // One can also run the write and read parts in two separate sessions. // For example following one of the sessions above, one can start the session: //   .L tree1.C //   tree1r();
New tutorial:
// This example is a variant of hsimple.C but using a TTree instead
// of a TNtuple. It shows :
//   -how to fill a Tree with a few simple variables.
//   -how to read this Tree
//   -how to browse and analyze the Tree via the TBrowser and TTreeViewer
// This example can be run in many different ways:
//  way1:  .x tree1.C    using the CINT interpreter
//  way2:  .x tree1.C++  using the automatic compiler interface
//  way3:  .L tree1.C  or .L tree1.C++
//          tree1()
// One can also run the write and read parts in two separate sessions.
// For example following one of the sessions above, one can start the session:
//   .L tree1.C
//   tree1r();


git-svn-id: ecbadac9c76e8cf640a0bca86f6bd796c98521e3@1928 27541ba8-7e3a-0410-8455-c3a389f83636

dawehner/root,dawehner/root,dawehner/root,dawehner/root,bbannier/ROOT,dawehner/root,bbannier/ROOT,bbannier/ROOT,dawehner/root,dawehner/root,dawehner/root,bbannier/ROOT,bbannier/ROOT,bbannier/ROOT,bbannier/ROOT