Count tree root nodes

[Uwe Raabe]

This should be slightly faster:

Delphi-Quellcode:

function CountRootNodes(ATree: TTreeView): Integer;
var
  node: TTreeNode;
begin
  Result := 0;

  node := ATree.Items.GetFirstNode;
  while node <> nil do begin
    Inc(Result);
    node := node.GetNextSibling;
  end;
end;