Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
searchtree
type tree=^tnode; tnode= record key:integer; left,right:tree; end; var T:tree; function count (T: tree): integer; var k, j: integer; begin if T^.key in ['0'..'9'] then count:=ord(T^.key)-ord('0') else begin if (T^.left <> nil) and (T^.right <> nil) then begin k:=count (T^.left); j:=count (T^.right); case T^.key of '+': count:=k+j; '-': count:=k-j; '*': count:=k*j; end; end else begin write ('error'); halt; end; end; end; begin new(T); T^.key:='*'; new(T^.left); new(T^.right); T^.left^.key:='9'; T^.right^.key:='6'; T^.left^.left:=nil; T^.left^.right:=nil; T^.right^.left:=nil; T^.right^.right:=nil; writeln (count (T)); dispose(T^.left); dispose(T^.right); dispose(T); end.
run
|
edit
|
history
|
help
0
test34
LewisCableCompanyPasProgramme
JohnnyHCao
zadanye 3 в
123
число pi разными способами
zadacha2
mulitp
10_4bhr.pas
Lineare Liste Aufbauen