I have a root file with the following structure
[ul]
[li]Tree 1
[list]
[]Brunch 11
[/li][li]Brunch 12
[/li][/ul][/:m]
[li]Tree 2
[ul]
[]Brunch 21
[/li][li]Brunch 22
[/li][/ul][/:m][/list:u]
I know that I can do
Is there a way to do
I have a root file with the following structure
[ul]
[li]Tree 1
[list]
[]Brunch 11
[/li][li]Brunch 12
[/li][/ul][/:m]
[li]Tree 2
[ul]
[]Brunch 21
[/li][li]Brunch 22
[/li][/ul][/:m][/list:u]
I know that I can do
Is there a way to do
I guess the best is to make the two trees “friends”. See the example here:
root.cern.ch/root/html/tutorials … end.C.html
In particular in the method DrawFriend() notice:
T->Draw("x:TF.x");
Ooops, Wile and I replied at the same time … good we said the same thing
Olivier
The problem is that the brunch names in both trees are the same. So actually it’s like
[ul]
[li]Tree 1
[list]
[]BrunchA
[/li][li]BrunchB
[/li][/ul][/:m]
[li]Tree 2
[ul]
[]BrunchA
[/li][li]BrunchB
[/li][/ul][/:m][/list:u]
So I can do
but then how am I going to draw BrunchA for Tree1 when BrunchA or BrunchB for Tree2 have to meet a condition?
A general form to uniquely identify a “” from a “” from a “”, when using the “Draw” method, is: ..