program PerfectBalancedTree;

type
  pSTreeNode = ^TSTreeNode;
  TSTreeNode = record
    info : integer;
    key : integer;
    left : pSTreeNode;
    right : pSTreeNode;
  end;

var
  pRoot, pPerm : pSTreeNode;
  answer, countOfNodes : integer;


procedure newTree(countOfNodes);
var
  pNew : pSTreeNode;
  i, countOfLeftNodes, countOfRightNodes : integer;
begin
  for i := 1 to countOfNodes do
  begin
    new(pNew);
    pNew^.info := random(100);
    pNew^.key := pNew^.info;
    pNew^.left := nil;
    pNew^.right := nil;
    while nl != 0 do
    begin

      nl := N div 2;
    end;
//    if pRoot = nil then pRoot := pNew else
//    begin
//      pTemp := pRoot;
//      if pNew^.key < pTemp^.key then
//
//    end;
  end;
end;

begin
  Randomize;
  pRoot := nil;
  repeat
    writeln('1. New tree');
    writeln('2. Direct search');
    readln(answer);
    if answer = 1 then
    begin
      write('How many nodes must have new tree?: ');
      readln(countOfNodes);
      newTree(countOfNodes);
    end;
  until answer = 3;
end.