Tree traversal: Difference between revisions
No edit summary |
PascalABC.NET |
||
(31 intermediate revisions by 16 users not shown) | |||
Line 34: | Line 34: | ||
{{trans|Python: Class based}} |
{{trans|Python: Class based}} |
||
< |
<syntaxhighlight lang="11l">T Node |
||
Int data |
Int data |
||
Node? left |
Node? left |
||
Line 44: | Line 44: | ||
.right = right |
.right = right |
||
F preorder(visitor) -> |
F preorder(visitor) -> Void |
||
visitor(.data) |
visitor(.data) |
||
I .left != N |
I .left != N |
||
Line 51: | Line 51: | ||
.right.preorder(visitor) |
.right.preorder(visitor) |
||
F inorder(visitor) -> |
F inorder(visitor) -> Void |
||
I .left != N |
I .left != N |
||
.left.inorder(visitor) |
.left.inorder(visitor) |
||
Line 58: | Line 58: | ||
.right.inorder(visitor) |
.right.inorder(visitor) |
||
F postorder(visitor) -> |
F postorder(visitor) -> Void |
||
I .left != N |
I .left != N |
||
.left.postorder(visitor) |
.left.postorder(visitor) |
||
Line 65: | Line 65: | ||
visitor(.data) |
visitor(.data) |
||
F preorder2(&d, level = 0) -> |
F preorder2(&d, level = 0) -> Void |
||
d[level].append(.data) |
d[level].append(.data) |
||
I .left != N |
I .left != N |
||
Line 105: | Line 105: | ||
print(‘levelorder: ’, end' ‘’) |
print(‘levelorder: ’, end' ‘’) |
||
tree.levelorder(printwithspace) |
tree.levelorder(printwithspace) |
||
print()</ |
print()</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
Line 114: | Line 114: | ||
levelorder: 1 2 3 4 5 6 7 8 9 |
levelorder: 1 2 3 4 5 6 7 8 9 |
||
</pre> |
</pre> |
||
=={{header|8080 Assembly}}== |
|||
<syntaxhighlight lang="asm8080"> org 100h |
|||
jmp demo |
|||
;;; Traverse tree at DE according to method at BC. |
|||
;;; Call routine at HL with DE=<value> for each value encounterd. |
|||
travrs: shld trvcb+1 ; Store routine pointer |
|||
xchg ; Tree in HL |
|||
push b ; Jump to method BC |
|||
ret |
|||
;;; Preorder traversal |
|||
preo: mov a,h |
|||
ora l |
|||
rz ; Null node = stop |
|||
mov e,m |
|||
inx h |
|||
mov d,m ; Load value |
|||
inx h |
|||
push h ; Handle value |
|||
call trvcb |
|||
pop h ; Left node |
|||
mov e,m |
|||
inx h |
|||
mov d,m |
|||
inx h |
|||
push h ; Save pointer |
|||
xchg |
|||
call preo |
|||
pop h |
|||
mov e,m |
|||
inx h ; Right node |
|||
mov d,m |
|||
xchg |
|||
jmp preo |
|||
;;; Inorder traversal |
|||
ino: mov a,h |
|||
ora l |
|||
rz ; Null node = stop |
|||
mov e,m |
|||
inx h |
|||
mov d,m ; Load value |
|||
inx h |
|||
push d ; Save value on stack |
|||
mov e,m |
|||
inx h |
|||
mov d,m |
|||
inx h ; Load left node |
|||
push h ; Save pointer on stack |
|||
xchg |
|||
call ino ; Traverse left node |
|||
pop h |
|||
pop d ; Get value |
|||
push h |
|||
call trvcb ; Handle value |
|||
pop h |
|||
mov e,m |
|||
inx h |
|||
mov d,m |
|||
xchg |
|||
jmp ino ; Traverse right node |
|||
;;; Postorder traversal |
|||
posto: mov a,h |
|||
ora l |
|||
rz ; Null node = stop |
|||
mov e,m |
|||
inx h |
|||
mov d,m ; Load value |
|||
inx h |
|||
push d ; Keep value on stack |
|||
mov e,m |
|||
inx h |
|||
mov d,m |
|||
inx h ; Load left node |
|||
push h |
|||
xchg |
|||
call posto ; Traverse left node |
|||
pop h |
|||
mov e,m |
|||
inx h |
|||
mov d,m ; Load right node |
|||
xchg |
|||
call posto ; Traverse right node |
|||
pop d ; Get value from stack |
|||
jmp trvcb ; Handle value |
|||
;;; Level-order traversal |
|||
lvlo: shld queue ; Store current node at beginning of queue |
|||
lxi h,queue ; HL = Queue start pointer |
|||
lxi b,queue+2 ; BC = Queue end pointer |
|||
lvllp: mov a,h ; When start == end, stop |
|||
cmp b |
|||
jnz lvlt ; Not equal |
|||
mov a,l |
|||
cmp c |
|||
rz ; Equal = stop |
|||
lvlt: mov e,m ; Load current node in DE |
|||
inx h |
|||
mov d,m |
|||
inx h |
|||
mov a,d ; Null node = ignore |
|||
ora e |
|||
jz lvllp |
|||
push h ; Keep queue start pointer |
|||
xchg ; HL = current node |
|||
mov e,m ; Load value into DE |
|||
inx h |
|||
mov d,m |
|||
inx h |
|||
push h ; Keep pointer to left and right nodes |
|||
push b ; And pointer to end of queue |
|||
call trvcb ; Handle value |
|||
pop b ; Restore pointer to end of queue |
|||
pop h ; Restore pointer to left and right nodes |
|||
mvi d,4 ; D = copy counter |
|||
lvlcp: mov a,m ; Copy left and right nodes to queue |
|||
stax b |
|||
inx h |
|||
inx b |
|||
dcr d |
|||
jnz lvlcp |
|||
pop h ; Restore queue stack pointer |
|||
jmp lvllp |
|||
trvcb: jmp 0 ; Callback pointer |
|||
;;; Run examples |
|||
demo: lhld 6 ; Move stack to top of memory |
|||
sphl |
|||
lxi h,0 ; So we can still RET out of the program |
|||
push h |
|||
lxi h,orders |
|||
order: mov e,m ; Get string |
|||
inx h |
|||
mov d,m |
|||
inx h |
|||
mov a,e ; 0 = done |
|||
ora d |
|||
rz |
|||
push h ; Print string |
|||
call print |
|||
pop h |
|||
mov c,m ; Load method in BC |
|||
inx h |
|||
mov b,m |
|||
inx h |
|||
push h |
|||
lxi d,tree ; Tree in DE |
|||
lxi h,cb ; Callback in HL |
|||
call travrs ; Traverse the tree |
|||
lxi d,nl |
|||
call print ; Newline |
|||
pop h ; Restore table pointer |
|||
jmp order |
|||
;;; Print the tree value. They're all <10 for the example, so we |
|||
;;; don't need multiple digits. |
|||
cb: mvi a,'0' |
|||
add e |
|||
sta nstr |
|||
lxi d,nstr |
|||
print: mvi c,9 ; CP/M print string call |
|||
jmp 5 |
|||
nstr: db '* $' |
|||
nl: db 13,10,'$' |
|||
;;; Example tree |
|||
tree: dw 1, node2, node3 |
|||
node2: dw 2, node4, node5 |
|||
node3: dw 3, node6, 0 |
|||
node4: dw 4, node7, 0 |
|||
node5: dw 5, 0, 0 |
|||
node6: dw 6, node8, node9 |
|||
node7: dw 7, 0, 0 |
|||
node8: dw 8, 0, 0 |
|||
node9: dw 9, 0 ,0 |
|||
;;; Table of names and orders |
|||
orders: dw spreo,preo |
|||
dw sino,ino |
|||
dw sposto,posto |
|||
dw slvlo,lvlo |
|||
dw 0 |
|||
spreo: db 'Preorder: $' |
|||
sino: db 'Inorder: $' |
|||
sposto: db 'Postorder: $' |
|||
slvlo: db 'Level-order: $' |
|||
queue: equ $ ; Put level-order queue on heap</syntaxhighlight> |
|||
{{out}} |
|||
<pre>Preorder: 1 2 4 7 5 3 6 8 9 |
|||
Inorder: 7 4 2 5 1 8 6 9 3 |
|||
Postorder: 7 4 5 2 8 9 6 3 1 |
|||
Level-order: 1 2 3 4 5 6 7 8 9</pre> |
|||
=={{header|8086 Assembly}}== |
|||
<syntaxhighlight lang="nasm"> cpu 8086 |
|||
org 100h |
|||
section .text |
|||
jmp demo |
|||
;;; Traverse tree at SI. Call routine at CX with values in AX. |
|||
;;; CX must preserve BX, CX, SI, DI. |
|||
;;; Preorder traversal |
|||
preo: test si,si |
|||
jz pdone ; Zero pointer = done |
|||
lodsw ; Load value |
|||
call cx ; Handle value |
|||
push si ; Keep value |
|||
mov si,[si] ; Load left node |
|||
call preo ; Traverse left node |
|||
pop si |
|||
mov si,[si+2] ; Load right node |
|||
jmp preo ; Traverse right node |
|||
;;; Inorder traversal |
|||
ino: test si,si |
|||
jz pdone ; Zero pointer = done |
|||
push si |
|||
mov si,[si+2] ; Load left node |
|||
call ino ; Traverse left node |
|||
pop si |
|||
lodsw ; Load value |
|||
call cx ; Handle value |
|||
mov si,[si+2] ; Load right node |
|||
jmp ino ; Traverse right node |
|||
;;; Postorder traversal |
|||
posto: test si,si |
|||
jz pdone ; Zero pointer = done |
|||
push si |
|||
mov si,[si+2] ; Load left node |
|||
call posto ; Traverse left node |
|||
pop si |
|||
push si |
|||
mov si,[si+4] ; Load right node |
|||
call posto |
|||
pop si ; Load value |
|||
lodsw |
|||
jmp cx ; Handle value |
|||
pdone: ret |
|||
;;; Level-order traversal |
|||
lvlo: mov di,queue ; DI = queue end pointer |
|||
mov ax,si |
|||
mov si,di ; SI = queue start pointer |
|||
stosw |
|||
.step: cmp di,si ; If end == start, done |
|||
je pdone |
|||
lodsw ; Get next item |
|||
test ax,ax ; Null? |
|||
jz .step |
|||
mov bx,si ; Keep start pointer in BX |
|||
mov si,ax ; Load item |
|||
lodsw ; Get value |
|||
call cx ; Handle value |
|||
lodsw ; Copy nodes to queue |
|||
stosw |
|||
lodsw |
|||
stosw |
|||
mov si,bx ; Put start pointer back |
|||
jmp .step |
|||
;;; Demo code |
|||
demo: mov si,orders |
|||
.loop: lodsw ; Load next order |
|||
test ax,ax |
|||
jz .done |
|||
mov dx,ax ; Print order name |
|||
mov ah,9 |
|||
int 21h |
|||
lodsw ; Load order routine |
|||
mov bp,si ; Keep SI |
|||
mov si,tree ; Traverse the tree |
|||
mov cx,pdgt ; Printing the digits |
|||
call ax |
|||
mov si,bp |
|||
jmp .loop |
|||
.done: ret |
|||
;;; Callback: print single digit |
|||
pdgt: add al,'0' |
|||
mov [.str],al |
|||
mov ah,9 |
|||
mov dx,.str |
|||
int 21h |
|||
ret |
|||
.str: db '* $' |
|||
section .data |
|||
;;; List of orders |
|||
orders: dw .preo,preo |
|||
dw .ino,ino |
|||
dw .posto,posto |
|||
dw .lvlo,lvlo |
|||
dw 0 |
|||
.preo: db 'Preorder: $' |
|||
.ino: db 13,10,'Inorder: $' |
|||
.posto: db 13,10,'Postorder: $' |
|||
.lvlo: db 13,10,'Level-order: $' |
|||
;;; Exampe tree |
|||
tree: dw 1,.n2,.n3 |
|||
.n2: dw 2,.n4,.n5 |
|||
.n3: dw 3,.n6,0 |
|||
.n4: dw 4,.n7,0 |
|||
.n5: dw 5,0,0 |
|||
.n6: dw 6,.n8,.n9 |
|||
.n7: dw 7,0,0 |
|||
.n8: dw 8,0,0 |
|||
.n9: dw 9,0,0 |
|||
section .bss |
|||
queue: resw 256</syntaxhighlight> |
|||
{{out}} |
|||
<pre>Preorder: 1 2 4 7 5 3 6 8 9 |
|||
Inorder: 7 4 2 5 1 8 6 9 3 |
|||
Postorder: 7 4 5 2 8 9 6 3 1 |
|||
Level-order: 1 2 3 4 5 6 7 8 9</pre> |
|||
=={{header|AArch64 Assembly}}== |
=={{header|AArch64 Assembly}}== |
||
{{works with|as|Raspberry Pi 3B version Buster 64 bits}} |
{{works with|as|Raspberry Pi 3B version Buster 64 bits}} |
||
<syntaxhighlight lang="aarch64 assembly"> |
|||
<lang AArch64 Assembly> |
|||
/* ARM assembly AARCH64 Raspberry PI 3B */ |
/* ARM assembly AARCH64 Raspberry PI 3B */ |
||
/* program deftree64.s */ |
/* program deftree64.s */ |
||
Line 505: | Line 817: | ||
/* for this file see task include a file in language AArch64 assembly */ |
/* for this file see task include a file in language AArch64 assembly */ |
||
.include "../includeARM64.inc" |
.include "../includeARM64.inc" |
||
</syntaxhighlight> |
|||
</lang> |
|||
=={{header|ACL2}}== |
=={{header|ACL2}}== |
||
< |
<syntaxhighlight lang="lisp">(defun flatten-preorder (tree) |
||
(if (endp tree) |
(if (endp tree) |
||
nil |
nil |
||
Line 554: | Line 866: | ||
(defun flatten-level (tree) |
(defun flatten-level (tree) |
||
(let ((levels (flatten-level-r1 tree 0 nil))) |
(let ((levels (flatten-level-r1 tree 0 nil))) |
||
(flatten-level-r2 levels (len levels))))</ |
(flatten-level-r2 levels (len levels))))</syntaxhighlight> |
||
=={{header|Action!}}== |
=={{header|Action!}}== |
||
Line 560: | Line 872: | ||
The user must type in the monitor the following command after compilation and before running the program!<pre>SET EndProg=*</pre> |
The user must type in the monitor the following command after compilation and before running the program!<pre>SET EndProg=*</pre> |
||
{{libheader|Action! Tool Kit}} |
{{libheader|Action! Tool Kit}} |
||
< |
<syntaxhighlight lang="action!">CARD EndProg ;required for ALLOCATE.ACT |
||
INCLUDE "D2:ALLOCATE.ACT" ;from the Action! Tool Kit. You must type 'SET EndProg=*' from the monitor after compiling, but before running this program! |
INCLUDE "D2:ALLOCATE.ACT" ;from the Action! Tool Kit. You must type 'SET EndProg=*' from the monitor after compiling, but before running this program! |
||
Line 810: | Line 1,122: | ||
DestroyTree(t) |
DestroyTree(t) |
||
RETURN</ |
RETURN</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Tree_traversal.png Screenshot from Atari 8-bit computer] |
[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Tree_traversal.png Screenshot from Atari 8-bit computer] |
||
Line 821: | Line 1,133: | ||
=={{header|Ada}}== |
=={{header|Ada}}== |
||
< |
<syntaxhighlight lang="ada">with Ada.Text_Io; use Ada.Text_Io; |
||
with Ada.Unchecked_Deallocation; |
with Ada.Unchecked_Deallocation; |
||
with Ada.Containers.Doubly_Linked_Lists; |
with Ada.Containers.Doubly_Linked_Lists; |
||
Line 928: | Line 1,240: | ||
New_Line; |
New_Line; |
||
Destroy_Tree(N); |
Destroy_Tree(N); |
||
end Tree_traversal;</ |
end Tree_traversal;</syntaxhighlight> |
||
=={{header|Agda}}== |
=={{header|Agda}}== |
||
< |
<syntaxhighlight lang="agda">open import Data.List using (List; _?_; []; concat) |
||
open import Data.Nat using ( |
open import Data.Nat using (N; suc; zero) |
||
open import Level using (Level) |
open import Level using (Level) |
||
open import Relation.Binary.PropositionalEquality using ( |
open import Relation.Binary.PropositionalEquality using (_=_; refl) |
||
data Tree {a} (A : Set a) : Set a where |
data Tree {a} (A : Set a) : Set a where |
||
leaf : Tree A |
leaf : Tree A |
||
node : A |
node : A ? Tree A ? Tree A ? Tree A |
||
variable |
variable |
||
Line 944: | Line 1,256: | ||
A : Set a |
A : Set a |
||
preorder : Tree A |
preorder : Tree A ? List A |
||
preorder tr = go tr [] |
preorder tr = go tr [] |
||
where |
where |
||
go : Tree A |
go : Tree A ? List A ? List A |
||
go leaf ys = ys |
go leaf ys = ys |
||
go (node x ls rs) ys = x |
go (node x ls rs) ys = x ? go ls (go rs ys) |
||
inorder : Tree A |
inorder : Tree A ? List A |
||
inorder tr = go tr [] |
inorder tr = go tr [] |
||
where |
where |
||
go : Tree A |
go : Tree A ? List A ? List A |
||
go leaf ys = ys |
go leaf ys = ys |
||
go (node x ls rs) ys = go ls (x |
go (node x ls rs) ys = go ls (x ? go rs ys) |
||
postorder : Tree A |
postorder : Tree A ? List A |
||
postorder tr = go tr [] |
postorder tr = go tr [] |
||
where |
where |
||
go : Tree A |
go : Tree A ? List A ? List A |
||
go leaf ys = ys |
go leaf ys = ys |
||
go (node x ls rs) ys = go ls (go rs (x |
go (node x ls rs) ys = go ls (go rs (x ? ys)) |
||
level-order : Tree A |
level-order : Tree A ? List A |
||
level-order tr = concat (go tr []) |
level-order tr = concat (go tr []) |
||
where |
where |
||
go : Tree A |
go : Tree A ? List (List A) ? List (List A) |
||
go leaf qs = qs |
go leaf qs = qs |
||
go (node x ls rs) [] = (x |
go (node x ls rs) [] = (x ? []) ? go ls (go rs []) |
||
go (node x ls rs) (q |
go (node x ls rs) (q ? qs) = (x ? q ) ? go ls (go rs qs) |
||
example-tree : Tree |
example-tree : Tree N |
||
example-tree = |
example-tree = |
||
node 1 |
node 1 |
||
Line 995: | Line 1,307: | ||
leaf) |
leaf) |
||
_ : preorder example-tree |
_ : preorder example-tree = 1 ? 2 ? 4 ? 7 ? 5 ? 3 ? 6 ? 8 ? 9 ? [] |
||
_ = refl |
_ = refl |
||
_ : inorder example-tree |
_ : inorder example-tree = 7 ? 4 ? 2 ? 5 ? 1 ? 8 ? 6 ? 9 ? 3 ? [] |
||
_ = refl |
_ = refl |
||
_ : postorder example-tree |
_ : postorder example-tree = 7 ? 4 ? 5 ? 2 ? 8 ? 9 ? 6 ? 3 ? 1 ? [] |
||
_ = refl |
_ = refl |
||
_ : level-order example-tree |
_ : level-order example-tree = 1 ? 2 ? 3 ? 4 ? 5 ? 6 ? 7 ? 8 ? 9 ? [] |
||
_ = refl</ |
_ = refl</syntaxhighlight> |
||
=={{header|ALGOL 68}}== |
=={{header|ALGOL 68}}== |
||
Line 1,017: | Line 1,329: | ||
{{works with|ELLA ALGOL 68|Any (with appropriate job cards)}} |
{{works with|ELLA ALGOL 68|Any (with appropriate job cards)}} |
||
< |
<syntaxhighlight lang="algol68">MODE VALUE = INT; |
||
PROC value repr = (VALUE value)STRING: whole(value, 0); |
PROC value repr = (VALUE value)STRING: whole(value, 0); |
||
Line 1,140: | Line 1,452: | ||
destroy tree(node) |
destroy tree(node) |
||
)</ |
)</syntaxhighlight> |
||
Output: |
Output: |
||
<pre> |
<pre> |
||
Line 1,152: | Line 1,464: | ||
Written in Dyalog APL with dfns. |
Written in Dyalog APL with dfns. |
||
< |
<syntaxhighlight lang="apl">preorder ? {l r?? ?? ? ? (?r)???(×?r)?(?l)???(×?l)?? ?? ?} |
||
inorder |
inorder ? {l r?? ?? ? ? (?r)???(×?r)?? ???(?l)???(×?l)??} |
||
postorder? {l r?? ?? ? ? ? ???(?r)???(×?r)?(?l)???(×?l)??} |
|||
postorder← {l r←⍺ ⍵⍵ ⍵ ⋄ ⍵ ⍺⍺⍨(⊃r)∇⍨⍣(×≢r)⊢(⊃l)∇⍨⍣(×≢l)⊢⍺} |
|||
lvlorder |
lvlorder ? {0=??:? ? (????/(??),??)??°(,/)?2??°??¨?}</syntaxhighlight> |
||
These accept four arguments (they are operators, a.k.a. higher-order functions): |
These accept four arguments (they are operators, a.k.a. higher-order functions): |
||
<pre>acc visit ___order children bintree</pre> |
<pre>acc visit ___order children bintree</pre> |
||
Line 1,174: | Line 1,486: | ||
and empty childL or childR mean and absence of the corresponding child node. |
and empty childL or childR mean and absence of the corresponding child node. |
||
< |
<syntaxhighlight lang="apl">tree?1(2(4(7??)?)(5??))(3(6(8??)(9??))?) |
||
visit?{?,(×??)???} |
|||
visit←{⍺,(×≢⍵)⍴⊃⍵} |
|||
children?{?¨@(×°?¨)1??}</syntaxhighlight> |
|||
Each time the accumulator is initialised as an empty list. Visiting a node means to append its data to the accumulator, and generating children is fetching the two corresponding sublists in the nested array if they're non-empty.<br> |
Each time the accumulator is initialised as an empty list. Visiting a node means to append its data to the accumulator, and generating children is fetching the two corresponding sublists in the nested array if they're non-empty.<br> |
||
My input into the interactive APL session is indented by 6 spaces. |
My input into the interactive APL session is indented by 6 spaces. |
||
<pre> |
<pre> |
||
? visit preorder children tree |
|||
1 2 4 7 5 3 6 8 9 |
1 2 4 7 5 3 6 8 9 |
||
? visit inorder children tree |
|||
7 4 2 5 1 8 6 9 3 |
7 4 2 5 1 8 6 9 3 |
||
? visit postorder children tree |
|||
7 4 5 2 8 9 6 3 1 |
7 4 5 2 8 9 6 3 1 |
||
? visit lvlorder children ,?tree |
|||
1 2 3 4 5 6 7 8 9 |
1 2 3 4 5 6 7 8 9 |
||
</pre> |
</pre> |
||
Line 1,198: | Line 1,510: | ||
=={{header|AppleScript}}== |
=={{header|AppleScript}}== |
||
{{Trans|JavaScript}}(ES6) |
{{Trans|JavaScript}}(ES6) |
||
< |
<syntaxhighlight lang="applescript">on run |
||
-- Sample tree of integers |
-- Sample tree of integers |
||
set tree to node(1, ¬ |
set tree to node(1, ¬ |
||
Line 1,212: | Line 1,524: | ||
-- 'Visualize a Tree': |
-- 'Visualize a Tree': |
||
set strTree to unlines({¬ |
set strTree to unlines({¬ |
||
" |
" + 4 - 7", ¬ |
||
" |
" + 2 ¦", ¬ |
||
" |
" ¦ + 5", ¬ |
||
" 1 |
" 1 ¦", ¬ |
||
" |
" ¦ + 8", ¬ |
||
" |
" + 3 - 6 ¦", ¬ |
||
" |
" + 9"}) |
||
script tabulate |
script tabulate |
||
on | |
on |?|(s, xs) |
||
justifyRight(14, space, s & ": ") & unwords(xs) |
justifyRight(14, space, s & ": ") & unwords(xs) |
||
end | |
end |?| |
||
end script |
end script |
||
Line 1,249: | Line 1,561: | ||
-- inorder :: a -> [[a]] -> [a] |
-- inorder :: a -> [[a]] -> [a] |
||
on inorder(x, xs) |
on inorder(x, xs) |
||
if {} |
if {} ? xs then |
||
item 1 of xs & x & concat(rest of xs) |
item 1 of xs & x & concat(rest of xs) |
||
else |
else |
||
Line 1,272: | Line 1,584: | ||
on foldTree(f) |
on foldTree(f) |
||
script |
script |
||
on | |
on |?|(tree) |
||
script go |
script go |
||
property g : | |
property g : |?| of mReturn(f) |
||
on | |
on |?|(oNode) |
||
g(root of oNode, | |
g(root of oNode, |?|(nest of oNode) ¬ |
||
of map(go)) |
of map(go)) |
||
end | |
end |?| |
||
end script |
end script |
||
| |
|?|(tree) of go |
||
end | |
end |?| |
||
end script |
end script |
||
end foldTree |
end foldTree |
||
Line 1,306: | Line 1,618: | ||
tell mReturn(contents of f) |
tell mReturn(contents of f) |
||
repeat with x in xs |
repeat with x in xs |
||
set end of lst to | |
set end of lst to |?|(contents of x) |
||
end repeat |
end repeat |
||
end tell |
end tell |
||
Line 1,336: | Line 1,648: | ||
set lng to length of xs |
set lng to length of xs |
||
repeat with i from lng to 1 by -1 |
repeat with i from lng to 1 by -1 |
||
set v to | |
set v to |?|(item i of xs, v, i, xs) |
||
end repeat |
end repeat |
||
return v |
return v |
||
Line 1,369: | Line 1,681: | ||
-- values of each level of the tree. |
-- values of each level of the tree. |
||
script go |
script go |
||
on | |
on |?|(node, a) |
||
if {} |
if {} ? a then |
||
tell a to set {h, t} to {item 1, rest} |
tell a to set {h, t} to {item 1, rest} |
||
else |
else |
||
Line 1,377: | Line 1,689: | ||
{{root of node} & h} & foldr(go, t, nest of node) |
{{root of node} & h} & foldr(go, t, nest of node) |
||
end | |
end |?| |
||
end script |
end script |
||
| |
|?|(tree, {}) of go |
||
end levels |
end levels |
||
Line 1,390: | Line 1,702: | ||
else |
else |
||
script |
script |
||
property | |
property |?| : f |
||
end script |
end script |
||
end if |
end if |
||
Line 1,401: | Line 1,713: | ||
-- to each element of xs. |
-- to each element of xs. |
||
script |
script |
||
on | |
on |?|(xs) |
||
tell mReturn(f) |
tell mReturn(f) |
||
set lng to length of xs |
set lng to length of xs |
||
set lst to {} |
set lst to {} |
||
repeat with i from 1 to lng |
repeat with i from 1 to lng |
||
set end of lst to | |
set end of lst to |?|(item i of xs, i, xs) |
||
end repeat |
end repeat |
||
return lst |
return lst |
||
end tell |
end tell |
||
end | |
end |?| |
||
end script |
end script |
||
end map |
end map |
||
Line 1,473: | Line 1,785: | ||
set ys to {} |
set ys to {} |
||
repeat with i from 1 to n |
repeat with i from 1 to n |
||
set v to | |
set v to |?|() of xs |
||
if missing value is v then |
if missing value is v then |
||
return ys |
return ys |
||
Line 1,518: | Line 1,830: | ||
tell mReturn(f) |
tell mReturn(f) |
||
repeat with i from 1 to lng |
repeat with i from 1 to lng |
||
set end of lst to | |
set end of lst to |?|(item i of xs_, item i of ys_) |
||
end repeat |
end repeat |
||
return lst |
return lst |
||
end tell |
end tell |
||
end zipWith</ |
end zipWith</syntaxhighlight> |
||
{{Out}} |
{{Out}} |
||
<pre> |
<pre> + 4 - 7 |
||
+ 2 ¦ |
|||
¦ + 5 |
|||
1 |
1 ¦ |
||
¦ + 8 |
|||
+ 3 - 6 ¦ |
|||
+ 9 |
|||
preorder: 1 2 4 7 5 3 6 8 9 |
preorder: 1 2 4 7 5 3 6 8 9 |
||
inorder: 7 4 2 5 1 8 6 9 3 |
inorder: 7 4 2 5 1 8 6 9 3 |
||
Line 1,538: | Line 1,850: | ||
=={{header|ARM Assembly}}== |
=={{header|ARM Assembly}}== |
||
{{works with|as|Raspberry Pi}} |
{{works with|as|Raspberry Pi}} |
||
<syntaxhighlight lang="arm assembly"> |
|||
<lang ARM Assembly> |
|||
/* ARM assembly Raspberry PI */ |
/* ARM assembly Raspberry PI */ |
||
Line 1,975: | Line 2,287: | ||
iMagicNumber: .int 0xCCCCCCCD |
iMagicNumber: .int 0xCCCCCCCD |
||
</syntaxhighlight> |
|||
</lang> |
|||
{{output}} |
{{output}} |
||
<pre> |
<pre> |
||
Line 2,022: | Line 2,334: | ||
=={{header|ATS}}== |
=={{header|ATS}}== |
||
< |
<syntaxhighlight lang="ats">#include |
||
"share/atspre_staload.hats" |
"share/atspre_staload.hats" |
||
// |
// |
||
Line 2,119: | Line 2,431: | ||
println! ("postorder:\t", postorder(t0)); |
println! ("postorder:\t", postorder(t0)); |
||
println! ("level-order:\t", levelorder(t0)); |
println! ("level-order:\t", levelorder(t0)); |
||
end (* end of [main0] *)</ |
end (* end of [main0] *)</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
Line 2,129: | Line 2,441: | ||
=={{header|AutoHotkey}}== |
=={{header|AutoHotkey}}== |
||
{{works with|AutoHotkey_L|45}} |
{{works with|AutoHotkey_L|45}} |
||
< |
<syntaxhighlight lang="autohotkey">AddNode(Tree,1,2,3,1) ; Build global Tree |
||
AddNode(Tree,2,4,5,2) |
AddNode(Tree,2,4,5,2) |
||
AddNode(Tree,3,6,0,3) |
AddNode(Tree,3,6,0,3) |
||
Line 2,181: | Line 2,493: | ||
t .= i%Lev%, Lev++ |
t .= i%Lev%, Lev++ |
||
Return t |
Return t |
||
}</ |
}</syntaxhighlight> |
||
=={{header|AWK}}== |
=={{header|AWK}}== |
||
< |
<syntaxhighlight lang="awk"> |
||
function preorder(tree, node, res, child) { |
function preorder(tree, node, res, child) { |
||
if (node == "") |
if (node == "") |
||
Line 2,274: | Line 2,586: | ||
delete result |
delete result |
||
} |
} |
||
</syntaxhighlight> |
|||
</lang> |
|||
=={{header|Bracmat}}== |
=={{header|Bracmat}}== |
||
< |
<syntaxhighlight lang="bracmat">( |
||
( tree |
( tree |
||
= 1 |
= 1 |
||
Line 2,317: | Line 2,629: | ||
& out$("level-order:" levelorder$(!tree.)) |
& out$("level-order:" levelorder$(!tree.)) |
||
& |
& |
||
)</ |
)</syntaxhighlight> |
||
=={{header|BCPL}}== |
|||
<syntaxhighlight lang="bcpl">get "libhdr" |
|||
manifest $( |
|||
VAL=0 |
|||
LEFT=1 |
|||
RIGHT=2 |
|||
$) |
|||
let tree(v,l,r) = valof |
|||
$( let obj = getvec(2) |
|||
obj!VAL := v |
|||
obj!LEFT := l |
|||
obj!RIGHT := r |
|||
resultis obj |
|||
$) |
|||
let preorder(tree, cb) be unless tree=0 |
|||
$( cb(tree!VAL) |
|||
preorder(tree!LEFT, cb) |
|||
preorder(tree!RIGHT, cb) |
|||
$) |
|||
let inorder(tree, cb) be unless tree=0 |
|||
$( inorder(tree!LEFT, cb) |
|||
cb(tree!VAL) |
|||
inorder(tree!RIGHT, cb) |
|||
$) |
|||
let postorder(tree, cb) be unless tree=0 |
|||
$( postorder(tree!LEFT, cb) |
|||
postorder(tree!RIGHT, cb) |
|||
cb(tree!VAL) |
|||
$) |
|||
let levelorder(tree, cb) be |
|||
$( let q=vec 255 |
|||
let s=0 and e=1 |
|||
q!0 := tree |
|||
until s=e do |
|||
$( unless q!s=0 do |
|||
$( q!e := q!s!LEFT |
|||
q!(e+1) := q!s!RIGHT |
|||
e := e+2 |
|||
cb(q!s!VAL) |
|||
$) |
|||
s := s+1 |
|||
$) |
|||
$) |
|||
let traverse(name, order, tree) be |
|||
$( let cb(n) be writef("%N ", n) |
|||
writef("%S:*T", name) |
|||
order(tree, cb) |
|||
wrch('*N') |
|||
$) |
|||
let start() be |
|||
$( let example = tree(1, tree(2, tree(4, tree(7, 0, 0), 0), |
|||
tree(5, 0, 0)), |
|||
tree(3, tree(6, tree(8, 0, 0), |
|||
tree(9, 0, 0)), |
|||
0)) |
|||
traverse("preorder", preorder, example) |
|||
traverse("inorder", inorder, example) |
|||
traverse("postorder", postorder, example) |
|||
traverse("level-order", levelorder, example) |
|||
$)</syntaxhighlight> |
|||
{{out}} |
|||
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
|||
inorder: 7 4 2 5 1 8 6 9 3 |
|||
postorder: 7 4 5 2 8 9 6 3 1 |
|||
level-order: 1 2 3 4 5 6 7 8 9</pre> |
|||
=={{header|C}}== |
=={{header|C}}== |
||
< |
<syntaxhighlight lang="c">#include <stdlib.h> |
||
#include <stdio.h> |
#include <stdio.h> |
||
Line 2,465: | Line 2,850: | ||
return 0; |
return 0; |
||
}</ |
}</syntaxhighlight> |
||
=={{header|C sharp}}== |
=={{header|C sharp}}== |
||
< |
<syntaxhighlight lang="csharp">using System; |
||
using System.Collections.Generic; |
using System.Collections.Generic; |
||
using System.Linq; |
using System.Linq; |
||
Line 2,539: | Line 2,924: | ||
Console.WriteLine("{0}:\t{1}", traversal.Method.Name, string.Join(" ", traversal())); |
Console.WriteLine("{0}:\t{1}", traversal.Method.Name, string.Join(" ", traversal())); |
||
} |
} |
||
}</ |
}</syntaxhighlight> |
||
=={{header|C++}}== |
=={{header|C++}}== |
||
Line 2,546: | Line 2,931: | ||
{{libheader|Boost|1.39.0}} |
{{libheader|Boost|1.39.0}} |
||
< |
<syntaxhighlight lang="cpp">#include <boost/scoped_ptr.hpp> |
||
#include <iostream> |
#include <iostream> |
||
#include <queue> |
#include <queue> |
||
Line 2,639: | Line 3,024: | ||
return 0; |
return 0; |
||
}</ |
}</syntaxhighlight> |
||
===Array version=== |
===Array version=== |
||
< |
<syntaxhighlight lang="cpp">#include <iostream> |
||
using namespace std; |
using namespace std; |
||
Line 2,710: | Line 3,095: | ||
level_order(t); |
level_order(t); |
||
cout << endl; |
cout << endl; |
||
}</ |
}</syntaxhighlight> |
||
===Modern C++=== |
===Modern C++=== |
||
{{works with|C++14}} |
{{works with|C++14}} |
||
< |
<syntaxhighlight lang="cpp">#include <iostream> |
||
#include <memory> |
#include <memory> |
||
#include <queue> |
#include <queue> |
||
Line 2,808: | Line 3,193: | ||
n.level_order(print); |
n.level_order(print); |
||
std::cout << '\n'; |
std::cout << '\n'; |
||
}</ |
}</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
Line 2,819: | Line 3,204: | ||
=={{header|Ceylon}}== |
=={{header|Ceylon}}== |
||
< |
<syntaxhighlight lang="ceylon">import ceylon.collection { |
||
ArrayList |
ArrayList |
||
} |
} |
||
Line 2,915: | Line 3,300: | ||
levelOrder(tree); |
levelOrder(tree); |
||
print(""); |
print(""); |
||
}</ |
}</syntaxhighlight> |
||
=={{header|Clojure}}== |
=={{header|Clojure}}== |
||
< |
<syntaxhighlight lang="clojure">(defn walk [node f order] |
||
(when node |
(when node |
||
(doseq [o order] |
(doseq [o order] |
||
Line 2,961: | Line 3,346: | ||
(print (format "%-12s" (str f ":"))) |
(print (format "%-12s" (str f ":"))) |
||
((resolve f) tree pr-node) |
((resolve f) tree pr-node) |
||
(println)))</ |
(println)))</syntaxhighlight> |
||
=={{header|CLU}}== |
=={{header|CLU}}== |
||
< |
<syntaxhighlight lang="clu">bintree = cluster [T: type] is leaf, node, |
||
pre_order, post_order, in_order, level_order |
pre_order, post_order, in_order, level_order |
||
branch = struct[left, right: bintree[T], val: T] |
branch = struct[left, right: bintree[T], val: T] |
||
Line 3,057: | Line 3,442: | ||
stream$puts(po, " " || int$unparse(i)) |
stream$puts(po, " " || int$unparse(i)) |
||
end |
end |
||
end start_up</ |
end start_up</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
||
Line 3,065: | Line 3,450: | ||
=={{header|CoffeeScript}}== |
=={{header|CoffeeScript}}== |
||
< |
<syntaxhighlight lang="coffeescript"> |
||
# In this example, we don't encapsulate binary trees as objects; instead, we have a |
# In this example, we don't encapsulate binary trees as objects; instead, we have a |
||
# convention on how to store them as arrays, and we namespace the functions that |
# convention on how to store them as arrays, and we namespace the functions that |
||
Line 3,112: | Line 3,497: | ||
test_walk "postorder" |
test_walk "postorder" |
||
test_walk "levelorder" |
test_walk "levelorder" |
||
</syntaxhighlight> |
|||
</lang> |
|||
output |
output |
||
< |
<pre> |
||
> coffee tree_traversal.coffee |
> coffee tree_traversal.coffee |
||
preorder 1 2 4 7 5 3 6 8 9 |
preorder 1 2 4 7 5 3 6 8 9 |
||
Line 3,120: | Line 3,505: | ||
postorder 7 4 5 2 8 9 6 3 1 |
postorder 7 4 5 2 8 9 6 3 1 |
||
levelorder 1 2 3 4 5 6 7 8 9 |
levelorder 1 2 3 4 5 6 7 8 9 |
||
</ |
</pre> |
||
=={{header|Common Lisp}}== |
=={{header|Common Lisp}}== |
||
< |
<syntaxhighlight lang="lisp">(defun preorder (node f) |
||
(when node |
(when node |
||
(funcall f (first node)) |
(funcall f (first node)) |
||
Line 3,161: | Line 3,546: | ||
(funcall traversal-function *tree* (lambda (value) (format t " ~A" value)))) |
(funcall traversal-function *tree* (lambda (value) (format t " ~A" value)))) |
||
(map nil #'show '(preorder inorder postorder level-order))</ |
(map nil #'show '(preorder inorder postorder level-order))</syntaxhighlight> |
||
Output: |
Output: |
||
Line 3,172: | Line 3,557: | ||
=={{header|Coq}}== |
=={{header|Coq}}== |
||
< |
<syntaxhighlight lang="coq">Require Import Utf8. |
||
Require Import List. |
Require Import List. |
||
Line 3,181: | Line 3,566: | ||
Fixpoint height (t: tree) : nat := |
Fixpoint height (t: tree) : nat := |
||
1 + fold_left ( |
1 + fold_left (? n t, max n (height t)) (children t) 0. |
||
Example leaf n : tree := {| value := n ; children := nil |}. |
Example leaf n : tree := {| value := n ; children := nil |}. |
||
Line 3,199: | Line 3,584: | ||
match c with |
match c with |
||
| nil => n :: nil |
| nil => n :: nil |
||
| |
| l :: r => inorder l ++ n :: flat_map inorder r |
||
end. |
end. |
||
Line 3,212: | Line 3,597: | ||
| O => nil |
| O => nil |
||
| S fuel' => |
| S fuel' => |
||
let '(p, f) := fold_right ( |
let '(p, f) := fold_right (? t r, let '(x, f) := r in (value t :: x, children t ++ f) ) (nil, nil) f in |
||
p ++ levelorder_forest fuel' f |
p ++ levelorder_forest fuel' f |
||
end. |
end. |
||
Line 3,223: | Line 3,608: | ||
Compute postorder t9. |
Compute postorder t9. |
||
Compute levelorder t9. |
Compute levelorder t9. |
||
</syntaxhighlight> |
|||
</lang> |
|||
=={{header|Crystal}}== |
=={{header|Crystal}}== |
||
{{trans|C++}} |
{{trans|C++}} |
||
< |
<syntaxhighlight lang="crystal"> |
||
class Node(T) |
class Node(T) |
||
property left : Nil | Node(T) |
property left : Nil | Node(T) |
||
Line 3,309: | Line 3,694: | ||
puts |
puts |
||
</syntaxhighlight> |
|||
</lang> |
|||
Output: |
Output: |
||
<pre> |
<pre> |
||
Line 3,320: | Line 3,705: | ||
=={{header|D}}== |
=={{header|D}}== |
||
This code is long because it's very generic. |
This code is long because it's very generic. |
||
< |
<syntaxhighlight lang="d">import std.stdio, std.traits; |
||
const final class Node(T) { |
const final class Node(T) { |
||
Line 3,396: | Line 3,781: | ||
tree.levelOrder; |
tree.levelOrder; |
||
writeln; |
writeln; |
||
}</ |
}</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre> preOrder: 1 2 4 7 5 3 6 8 9 |
<pre> preOrder: 1 2 4 7 5 3 6 8 9 |
||
Line 3,406: | Line 3,791: | ||
{{trans|Haskell}} |
{{trans|Haskell}} |
||
Generic as the first version, but not lazy as the Haskell version. |
Generic as the first version, but not lazy as the Haskell version. |
||
< |
<syntaxhighlight lang="d">const struct Node(T) { |
||
T v; |
T v; |
||
Node* l, r; |
Node* l, r; |
||
Line 3,449: | Line 3,834: | ||
writeln(postOrder(tree)); |
writeln(postOrder(tree)); |
||
writeln(levelOrder(tree)); |
writeln(levelOrder(tree)); |
||
}</ |
}</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre>[1, 2, 4, 7, 5, 3, 6, 8, 9] |
<pre>[1, 2, 4, 7, 5, 3, 6, 8, 9] |
||
Line 3,458: | Line 3,843: | ||
===Alternative Lazy Version=== |
===Alternative Lazy Version=== |
||
This version is not complete, it lacks the level order visit. |
This version is not complete, it lacks the level order visit. |
||
< |
<syntaxhighlight lang="d">import std.stdio, std.algorithm, std.range, std.string; |
||
const struct Tree(T) { |
const struct Tree(T) { |
||
Line 3,522: | Line 3,907: | ||
tree.inOrder.map!(t => t.value).writeln; |
tree.inOrder.map!(t => t.value).writeln; |
||
tree.postOrder.map!(t => t.value).writeln; |
tree.postOrder.map!(t => t.value).writeln; |
||
}</ |
}</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre>[1, 2, 4, 7, 5, 3, 6, 8, 9] |
<pre>[1, 2, 4, 7, 5, 3, 6, 8, 9] |
||
[7, 4, 2, 5, 1, 8, 6, 9, 3] |
[7, 4, 2, 5, 1, 8, 6, 9, 3] |
||
[7, 4, 5, 2, 8, 9, 6, 3, 1]</pre> |
[7, 4, 5, 2, 8, 9, 6, 3, 1]</pre> |
||
=={{header|Delphi}}== |
|||
{{works with|Delphi|6.0}} |
|||
{{libheader|SysUtils,StdCtrls}} |
|||
<syntaxhighlight lang="Delphi"> |
|||
{Structure holding node data} |
|||
type PNode = ^TNode; |
|||
TNode = record |
|||
Data: integer; |
|||
Left,Right: PNode; |
|||
end; |
|||
function PreOrder(Node: TNode): string; |
|||
{Recursively traverse Node-Left-Right} |
|||
begin |
|||
Result:=IntToStr(Node.Data); |
|||
if Node.Left<>nil then Result:=Result+' '+PreOrder(Node.Left^); |
|||
if Node.Right<>nil then Result:=Result+' '+PreOrder(Node.Right^); |
|||
end; |
|||
function InOrder(Node: TNode): string; |
|||
{Recursively traverse Left-Node-Right} |
|||
begin |
|||
Result:=''; |
|||
if Node.Left<>nil then Result:=Result+inOrder(Node.Left^); |
|||
Result:=Result+IntToStr(Node.Data)+' '; |
|||
if Node.Right<>nil then Result:=Result+inOrder(Node.Right^); |
|||
end; |
|||
function PostOrder(Node: TNode): string; |
|||
{Recursively traverse Left-Right-Node} |
|||
begin |
|||
Result:=''; |
|||
if Node.Left<>nil then Result:=Result+PostOrder(Node.Left^); |
|||
if Node.Right<>nil then Result:=Result+PostOrder(Node.Right^); |
|||
Result:=Result+IntToStr(Node.Data)+' '; |
|||
end; |
|||
function LevelOrder(Node: TNode): string; |
|||
{Traverse the tree at each level, Left to right} |
|||
var Queue: TList; |
|||
var NT: TNode; |
|||
begin |
|||
Queue:=TList.Create; |
|||
try |
|||
Result:=''; |
|||
Queue.Add(@Node); |
|||
while true do |
|||
begin |
|||
{Display oldest node in queue} |
|||
NT:=PNode(Queue[0])^; |
|||
Queue.Delete(0); |
|||
Result:=Result+IntToStr(NT.Data)+' '; |
|||
{Queue left and right children} |
|||
if NT.left<>nil then Queue.add(NT.left); |
|||
if NT.right<>nil then Queue.add(NT.right); |
|||
if Queue.Count<1 then break; |
|||
end; |
|||
finally Queue.Free; end; |
|||
end; |
|||
procedure ShowBinaryTree(Memo: TMemo); |
|||
var Tree: array [0..9] of TNode; |
|||
var I: integer; |
|||
begin |
|||
{Fill array of node with data} |
|||
{that matchs its position in the array} |
|||
for I:=0 to High(Tree) do |
|||
begin |
|||
Tree[I].Data:=I+1; |
|||
Tree[I].Left:=nil; |
|||
Tree[I].Right:=nil; |
|||
end; |
|||
{Build the specified tree} |
|||
Tree[0].left:=@Tree[2-1]; |
|||
Tree[0].right:=@Tree[3-1]; |
|||
Tree[1].left:=@Tree[4-1]; |
|||
Tree[1].right:=@Tree[5-1]; |
|||
Tree[3].left:=@Tree[7-1]; |
|||
Tree[2].left:=@Tree[6-1]; |
|||
Tree[5].left:=@Tree[8-1]; |
|||
Tree[5].right:=@Tree[9-1]; |
|||
{Tranverse the tree in four specified ways} |
|||
Memo.Lines.Add('Pre-Order: '+PreOrder(Tree[0])); |
|||
Memo.Lines.Add('In-Order: '+InOrder(Tree[0])); |
|||
Memo.Lines.Add('Post-Order: '+PostOrder(Tree[0])); |
|||
Memo.Lines.Add('Level-Order: '+LevelOrder(Tree[0])); |
|||
end; |
|||
</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
Pre-Order: 1 2 4 7 5 3 6 8 9 |
|||
In-Order: 7 4 2 5 1 8 6 9 3 |
|||
Post-Order: 7 4 5 2 8 9 6 3 1 |
|||
Level-Order: 1 2 3 4 5 6 7 8 9 |
|||
Elapsed Time: 4.897 ms. |
|||
</pre> |
|||
=={{header|Draco}}== |
|||
<syntaxhighlight lang="draco">type |
|||
Node = struct { |
|||
int val; |
|||
*Node left, right; |
|||
}, |
|||
Tree = *Node; |
|||
proc tree(int v; Tree l, r) Tree: |
|||
Tree t; |
|||
t := new(Node); |
|||
t*.val := v; |
|||
t*.left := l; |
|||
t*.right := r; |
|||
t |
|||
corp |
|||
proc preorder(Tree t) void: |
|||
if t /= nil then |
|||
write(t*.val, ' '); |
|||
preorder(t*.left); |
|||
preorder(t*.right) |
|||
fi |
|||
corp |
|||
proc inorder(Tree t) void: |
|||
if t /= nil then |
|||
inorder(t*.left); |
|||
write(t*.val, ' '); |
|||
inorder(t*.right) |
|||
fi |
|||
corp |
|||
proc postorder(Tree t) void: |
|||
if t /= nil then |
|||
postorder(t*.left); |
|||
postorder(t*.right); |
|||
write(t*.val, ' ') |
|||
fi |
|||
corp |
|||
proc levelorder(Tree t) void: |
|||
[256]Tree q; |
|||
word s, e; |
|||
s := 0; |
|||
q[s] := t; |
|||
e := 1; |
|||
while s /= e do |
|||
if q[s] /= nil then |
|||
q[e] := q[s]*.left; |
|||
q[e+1] := q[s]*.right; |
|||
e := e+2; |
|||
write(q[s]*.val, ' ') |
|||
fi; |
|||
s := s+1 |
|||
od |
|||
corp |
|||
proc main() void: |
|||
Tree t; |
|||
t := tree(1, |
|||
tree(2, |
|||
tree(4, |
|||
tree(7,nil,nil), |
|||
nil), |
|||
tree(5,nil,nil)), |
|||
tree(3, |
|||
tree(6, |
|||
tree(8,nil,nil), |
|||
tree(9,nil,nil)), |
|||
nil)); |
|||
write("preorder: "); preorder(t); writeln(); |
|||
write("inorder: "); inorder(t); writeln(); |
|||
write("postorder: "); postorder(t); writeln(); |
|||
write("level-order: "); levelorder(t); writeln(); |
|||
corp</syntaxhighlight> |
|||
{{out}} |
|||
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
|||
inorder: 7 4 2 5 1 8 6 9 3 |
|||
postorder: 7 4 5 2 8 9 6 3 1 |
|||
level-order: 1 2 3 4 5 6 7 8 9</pre> |
|||
=={{header|E}}== |
=={{header|E}}== |
||
< |
<syntaxhighlight lang="e">def btree := [1, [2, [4, [7, null, null], |
||
null], |
null], |
||
[5, null, null]], |
[5, null, null]], |
||
Line 3,576: | Line 4,155: | ||
print("level-order:") |
print("level-order:") |
||
levelOrder(btree, fn v { print(" ", v) }) |
levelOrder(btree, fn v { print(" ", v) }) |
||
println()</ |
println()</syntaxhighlight> |
||
=={{header|EasyLang}}== |
|||
{{trans|C}} |
|||
<syntaxhighlight lang=easylang> |
|||
tree[] = [ 1 2 3 4 5 6 -1 7 -1 -1 -1 8 9 ] |
|||
# |
|||
proc preorder ind . . |
|||
if ind > len tree[] or tree[ind] = -1 |
|||
return |
|||
. |
|||
write " " & tree[ind] |
|||
preorder ind * 2 |
|||
preorder ind * 2 + 1 |
|||
. |
|||
write "preorder:" |
|||
preorder 1 |
|||
print "" |
|||
# |
|||
proc inorder ind . . |
|||
if ind > len tree[] or tree[ind] = -1 |
|||
return |
|||
. |
|||
inorder ind * 2 |
|||
write " " & tree[ind] |
|||
inorder ind * 2 + 1 |
|||
. |
|||
write "inorder:" |
|||
inorder 1 |
|||
print "" |
|||
# |
|||
proc postorder ind . . |
|||
if ind > len tree[] or tree[ind] = -1 |
|||
return |
|||
. |
|||
postorder ind * 2 |
|||
postorder ind * 2 + 1 |
|||
write " " & tree[ind] |
|||
. |
|||
write "postorder:" |
|||
postorder 1 |
|||
print "" |
|||
# |
|||
global tail head queue[] . |
|||
proc initqu n . . |
|||
len queue[] n |
|||
tail = 1 |
|||
head = 1 |
|||
. |
|||
proc enqu v . . |
|||
queue[tail] = v |
|||
tail = (tail + 1) mod1 len queue[] |
|||
. |
|||
func dequ . |
|||
if head = tail |
|||
return -1 |
|||
. |
|||
h = head |
|||
head = (head + 1) mod1 len queue[] |
|||
return queue[h] |
|||
. |
|||
initqu len tree[] |
|||
proc levelorder n . . |
|||
enqu n |
|||
repeat |
|||
ind = dequ |
|||
until ind = -1 |
|||
if ind < len tree[] and tree[ind] <> -1 |
|||
write " " & tree[ind] |
|||
enqu ind * 2 |
|||
enqu ind * 2 + 1 |
|||
. |
|||
. |
|||
. |
|||
write "level-order:" |
|||
levelorder 1 |
|||
print "" |
|||
</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
preorder: 1 2 4 7 5 3 6 8 9 |
|||
inorder: 7 4 2 5 1 8 6 9 3 |
|||
postorder: 7 4 5 2 8 9 6 3 1 |
|||
level-order: 1 2 3 4 5 6 7 8 |
|||
</pre> |
|||
=={{header|Eiffel}}== |
=={{header|Eiffel}}== |
||
Line 3,582: | Line 4,245: | ||
Void-Safety has been disabled for simplicity of the code. |
Void-Safety has been disabled for simplicity of the code. |
||
< |
<syntaxhighlight lang="eiffel ">note |
||
description : "Application for tree traversal demonstration" |
description : "Application for tree traversal demonstration" |
||
output : "[ |
output : "[ |
||
Line 3,632: | Line 4,295: | ||
end |
end |
||
end -- class APPLICATION</ |
end -- class APPLICATION</syntaxhighlight> |
||
< |
<syntaxhighlight lang="eiffel ">note |
||
description : "A simple node for a binary tree" |
description : "A simple node for a binary tree" |
||
libraries : "Relies on LINKED_LIST from EiffelBase" |
libraries : "Relies on LINKED_LIST from EiffelBase" |
||
Line 3,759: | Line 4,422: | ||
end |
end |
||
-- class NODE</ |
-- class NODE</syntaxhighlight> |
||
=={{header|Elena}}== |
=={{header|Elena}}== |
||
ELENA |
ELENA 6.x : |
||
< |
<syntaxhighlight lang="elena">import extensions; |
||
import extensions'routines; |
import extensions'routines; |
||
import system'collections; |
import system'collections; |
||
Line 3,775: | Line 4,438: | ||
class Node |
class Node |
||
{ |
{ |
||
int Value : rprop; |
|||
Node Left : rprop; |
|||
Node Right : rprop; |
|||
constructor new(int value) |
constructor new(int value) |
||
Line 3,841: | Line 4,504: | ||
LevelOrder = new Enumerable |
LevelOrder = new Enumerable |
||
{ |
{ |
||
Queue<Node> queue := class Queue<Node>.allocate(4).push |
Queue<Node> queue := class Queue<Node>.allocate(4).push(self); |
||
Enumerator enumerator() = new Enumerator |
Enumerator enumerator() = new Enumerator |
||
Line 3,847: | Line 4,510: | ||
bool next() = queue.isNotEmpty(); |
bool next() = queue.isNotEmpty(); |
||
get() |
get Value() |
||
{ |
{ |
||
Node item := queue.pop(); |
Node item := queue.pop(); |
||
Line 3,883: | Line 4,546: | ||
console.printLine("Postorder :", tree.Postorder); |
console.printLine("Postorder :", tree.Postorder); |
||
console.printLine("LevelOrder:", tree.LevelOrder) |
console.printLine("LevelOrder:", tree.LevelOrder) |
||
}</ |
}</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
Line 3,894: | Line 4,557: | ||
=={{header|Elisa}}== |
=={{header|Elisa}}== |
||
This is a generic component for binary tree traversals. More information about binary trees in Elisa are given in [http://jklunder.home.xs4all.nl/elisa/part02/doc030.html trees]. |
This is a generic component for binary tree traversals. More information about binary trees in Elisa are given in [http://jklunder.home.xs4all.nl/elisa/part02/doc030.html trees]. |
||
<syntaxhighlight lang="elisa"> |
|||
<lang Elisa> |
|||
component BinaryTreeTraversals (Tree, Element); |
component BinaryTreeTraversals (Tree, Element); |
||
type Tree; |
type Tree; |
||
Line 3,931: | Line 4,594: | ||
]; |
]; |
||
end component BinaryTreeTraversals; |
end component BinaryTreeTraversals; |
||
</syntaxhighlight> |
|||
</lang> |
|||
Tests |
Tests |
||
<syntaxhighlight lang="elisa"> |
|||
<lang Elisa> |
|||
use BinaryTreeTraversals (Tree, integer); |
use BinaryTreeTraversals (Tree, integer); |
||
Line 3,953: | Line 4,616: | ||
{Item(Level_order(BT))}? |
{Item(Level_order(BT))}? |
||
{ 1, 2, 3, 4, 5, 6, 7, 8, 9} |
{ 1, 2, 3, 4, 5, 6, 7, 8, 9} |
||
</syntaxhighlight> |
|||
</lang> |
|||
=={{header|Elixir}}== |
=={{header|Elixir}}== |
||
{{trans|Erlang}} |
{{trans|Erlang}} |
||
< |
<syntaxhighlight lang="elixir">defmodule Tree_Traversal do |
||
defp tnode, do: {} |
defp tnode, do: {} |
||
defp tnode(v), do: {:node, v, {}, {}} |
defp tnode(v), do: {:node, v, {}, {}} |
||
Line 4,012: | Line 4,675: | ||
end |
end |
||
Tree_Traversal.main</ |
Tree_Traversal.main</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
Line 4,020: | Line 4,683: | ||
postorder: 7 4 5 2 8 9 6 3 1 |
postorder: 7 4 5 2 8 9 6 3 1 |
||
levelorder: 1 2 3 4 5 6 7 8 9 |
levelorder: 1 2 3 4 5 6 7 8 9 |
||
</pre> |
|||
=={{header|EMal}}== |
|||
{{trans|Java}} |
|||
<syntaxhighlight lang="emal"> |
|||
type Node |
|||
model |
|||
:T value |
|||
Node left |
|||
Node right |
|||
new by generic T, :T ←value do end |
|||
fun visit ← <|write(me.value + " ") |
|||
end |
|||
type Order |
|||
enum |
|||
int PREORDER, INORDER, POSTORDER, LEVELORDER |
|||
end |
|||
type Main |
|||
fun traverse ← void by Node node, Order order |
|||
if node æ null do return end |
|||
if order æ Order.PREORDER |
|||
node.visit() |
|||
traverse(node.left, order) |
|||
traverse(node.right, order) |
|||
else if order æ Order.INORDER |
|||
traverse(node.left, order) |
|||
node.visit() |
|||
traverse(node.right, order) |
|||
else if order æ Order.POSTORDER |
|||
traverse(node.left, order) |
|||
traverse(node.right, order) |
|||
node.visit() |
|||
else if order æ Order.LEVELORDER |
|||
List queue ← Node[] |
|||
queue.insertFirst(node) |
|||
while not queue.isEmpty() |
|||
Node next ← queue.deleteLast() |
|||
next.visit() |
|||
if next.left ≠ null do queue.insertFirst(next.left) end |
|||
if next.right ≠ null do queue.insertFirst(next.right) end |
|||
end |
|||
end |
|||
end |
|||
Node one ← Node(int, 1) |
|||
Node two ← Node(int, 2) |
|||
Node three ← Node(int, 3) |
|||
Node four ← Node(int, 4) |
|||
Node five ← Node(int, 5) |
|||
Node six ← Node(int, 6) |
|||
Node seven ← Node(int, 7) |
|||
Node eight ← Node(int, 8) |
|||
Node nine ← Node(int, 9) |
|||
one.left ← two |
|||
one.right ← three |
|||
two.left ← four |
|||
two.right ← five |
|||
three.left ← six |
|||
four.left ← seven |
|||
six.left ← eight |
|||
six.right ← nine |
|||
traverse(one, Order.PREORDER) |
|||
writeLine() |
|||
traverse(one, Order.INORDER) |
|||
writeLine() |
|||
traverse(one, Order.POSTORDER) |
|||
writeLine() |
|||
traverse(one, Order.LEVELORDER) |
|||
writeLine() |
|||
</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
1 2 4 7 5 3 6 8 9 |
|||
7 4 2 5 1 8 6 9 3 |
|||
7 4 5 2 8 9 6 3 1 |
|||
1 2 3 4 5 6 7 8 9 |
|||
</pre> |
</pre> |
||
=={{header|Erlang}}== |
=={{header|Erlang}}== |
||
< |
<syntaxhighlight lang="erlang">-module(tree_traversal). |
||
-export([main/0]). |
-export([main/0]). |
||
-export([preorder/2, inorder/2, postorder/2, levelorder/2]). |
-export([preorder/2, inorder/2, postorder/2, levelorder/2]). |
||
Line 4,064: | Line 4,802: | ||
inorder(F, Tree), ?NEWLINE, |
inorder(F, Tree), ?NEWLINE, |
||
postorder(F, Tree), ?NEWLINE, |
postorder(F, Tree), ?NEWLINE, |
||
levelorder(F, Tree), ?NEWLINE.</ |
levelorder(F, Tree), ?NEWLINE.</syntaxhighlight> |
||
Output: |
Output: |
||
Line 4,074: | Line 4,812: | ||
=={{header|Euphoria}}== |
=={{header|Euphoria}}== |
||
< |
<syntaxhighlight lang="euphoria">constant VALUE = 1, LEFT = 2, RIGHT = 3 |
||
constant tree = {1, |
constant tree = {1, |
||
Line 4,140: | Line 4,878: | ||
puts(1,"level-order: ") |
puts(1,"level-order: ") |
||
level_order(tree) |
level_order(tree) |
||
puts(1,'\n')</ |
puts(1,'\n')</syntaxhighlight> |
||
Output: |
Output: |
||
Line 4,149: | Line 4,887: | ||
=={{header|F_Sharp|F#}}== |
=={{header|F_Sharp|F#}}== |
||
< |
<syntaxhighlight lang="fsharp">open System |
||
open System.IO |
open System.IO |
||
Line 4,223: | Line 4,961: | ||
printf "\nlevel-order: " |
printf "\nlevel-order: " |
||
levelorder tree |> Seq.iter show |
levelorder tree |> Seq.iter show |
||
0</ |
0</syntaxhighlight> |
||
=={{header|Factor}}== |
=={{header|Factor}}== |
||
< |
<syntaxhighlight lang="factor">USING: accessors combinators deques dlists fry io kernel |
||
math.parser ; |
math.parser ; |
||
IN: rosetta.tree-traversal |
IN: rosetta.tree-traversal |
||
Line 4,297: | Line 5,035: | ||
[ "levelorder: " write levelorder nl ] |
[ "levelorder: " write levelorder nl ] |
||
[ "levelorder2: " write levelorder2 nl ] |
[ "levelorder2: " write levelorder2 nl ] |
||
} 2cleave ;</ |
} 2cleave ;</syntaxhighlight> |
||
=={{header|Fantom}}== |
=={{header|Fantom}}== |
||
< |
<syntaxhighlight lang="fantom"> |
||
class Tree |
class Tree |
||
{ |
{ |
||
Line 4,370: | Line 5,108: | ||
} |
} |
||
} |
} |
||
</syntaxhighlight> |
|||
</lang> |
|||
Output: |
Output: |
||
Line 4,381: | Line 5,119: | ||
=={{header|Forth}}== |
=={{header|Forth}}== |
||
< |
<syntaxhighlight lang="forth">\ binary tree (dictionary) |
||
: node ( l r data -- node ) here >r , , , r> ; |
: node ( l r data -- node ) here >r , , , r> ; |
||
: leaf ( data -- node ) 0 0 rot node ; |
: leaf ( data -- node ) 0 0 rot node ; |
||
Line 4,436: | Line 5,174: | ||
cr ' . tree postorder \ 7 4 5 2 8 9 6 3 1 |
cr ' . tree postorder \ 7 4 5 2 8 9 6 3 1 |
||
cr tree max-depth . \ 4 |
cr tree max-depth . \ 4 |
||
cr ' . tree levelorder \ 1 2 3 4 5 6 7 8 9</ |
cr ' . tree levelorder \ 1 2 3 4 5 6 7 8 9</syntaxhighlight> |
||
=={{header|Fortran}}== |
=={{header|Fortran}}== |
||
Line 4,446: | Line 5,184: | ||
Otherwise, one can always write detailed code that gives effect to recursive usage, typically involving a variable called SP and an array called STACK. Oddly, such proceedings for the QuickSort algorithm are often declared to be "iterative", presumably because the absence of formally-declared recursive phrases blocks recognition of recursive action. |
Otherwise, one can always write detailed code that gives effect to recursive usage, typically involving a variable called SP and an array called STACK. Oddly, such proceedings for the QuickSort algorithm are often declared to be "iterative", presumably because the absence of formally-declared recursive phrases blocks recognition of recursive action. |
||
In the example source, the mainline, GORILLA, does its recursion via array twiddling and in that spirit, uses multiple lists for the "level" style traversal so that one tree clamber only need be made, whereas the recursive equivalent cheats by commanding one clamber for each level. The recursive routines store their state in part via the position within their code - that is, before, between, or after the recursive invocations, and are much easier to compare. Rather than litter the source with separate routines and their declarations for each of the four styles required, routine TARZAN has the four versions together for easy comparison, distinguished by a CASE statement. Actually, the code could be even more compact as in < |
In the example source, the mainline, GORILLA, does its recursion via array twiddling and in that spirit, uses multiple lists for the "level" style traversal so that one tree clamber only need be made, whereas the recursive equivalent cheats by commanding one clamber for each level. The recursive routines store their state in part via the position within their code - that is, before, between, or after the recursive invocations, and are much easier to compare. Rather than litter the source with separate routines and their declarations for each of the four styles required, routine TARZAN has the four versions together for easy comparison, distinguished by a CASE statement. Actually, the code could be even more compact as in <syntaxhighlight lang="fortran"> |
||
IF (STYLE.EQ."PRE") CALL OUT(HAS) |
IF (STYLE.EQ."PRE") CALL OUT(HAS) |
||
IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE) |
IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE) |
||
IF (STYLE.EQ."IN") CALL OUT(HAS) |
IF (STYLE.EQ."IN") CALL OUT(HAS) |
||
IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE) |
IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE) |
||
IF (STYLE.EQ."POST") CALL OUT(HAS)</ |
IF (STYLE.EQ."POST") CALL OUT(HAS)</syntaxhighlight> |
||
But that would cloud the simplicity of each separate version, and would be extra messy with the fourth option included. On the other hand, the requirements for formal recursion carry the cost of the entry/exit protocol and moreover must do so for every invocation (though there is sometimes opportunity for end-recursion to be converted into a secret "go to") - avoiding this is why every invocation of TARZAN first checks that it has a live link, rather than coding this once only within TARZAN to return immediately when invoked with a dead link - whereas the array twiddling via SP deals only with what is required and notably, avoids raising the stack if it can. Further, the GORILLA version can if necessary maintain additional information, as is needed for the postorder traversal where, not having state information stored via position in the code (as with the recursive version) it needs to know whether it is returning to a node from which it departed via the rightwards link and so is in the post-traversal state and thus due a postorder action. This could involve an auxiliary array, but here is handled by taking advantage of the sign of the STACK element. This sort of trick might still be possible even if the link values were memory addresses rather than array indices, as many computers do not use their full word size for addressing. |
But that would cloud the simplicity of each separate version, and would be extra messy with the fourth option included. On the other hand, the requirements for formal recursion carry the cost of the entry/exit protocol and moreover must do so for every invocation (though there is sometimes opportunity for end-recursion to be converted into a secret "go to") - avoiding this is why every invocation of TARZAN first checks that it has a live link, rather than coding this once only within TARZAN to return immediately when invoked with a dead link - whereas the array twiddling via SP deals only with what is required and notably, avoids raising the stack if it can. Further, the GORILLA version can if necessary maintain additional information, as is needed for the postorder traversal where, not having state information stored via position in the code (as with the recursive version) it needs to know whether it is returning to a node from which it departed via the rightwards link and so is in the post-traversal state and thus due a postorder action. This could involve an auxiliary array, but here is handled by taking advantage of the sign of the STACK element. This sort of trick might still be possible even if the link values were memory addresses rather than array indices, as many computers do not use their full word size for addressing. |
||
Line 4,458: | Line 5,196: | ||
Except for the usage of array MIST having an element zero and the use of an array assignment MIST(:,0) = 0, the GORILLA code is old-style Fortran. One could play tricks with EQUIVALENCE statements to arrange that an array's first element was at index zero, but that would rely on the absence of array bound checking and is more difficult with multi-dimensional arrays. Instead, one would make do either by having a separate list length variable, or else remembering the offsets... The MODULE usage requires F90 or later and provides a convenient protocol for global data, otherwise one must mess about with COMMON or parameter hordes. If that were done, the B6700 compiler would have handled it. But for the benefit of trembling modern compilers it also contains the fearsome new attribute, RECURSIVE, to flog the compilers into what was formalised for Algol in 1960 and was available ''for free'' via Burroughs in the 1970s. |
Except for the usage of array MIST having an element zero and the use of an array assignment MIST(:,0) = 0, the GORILLA code is old-style Fortran. One could play tricks with EQUIVALENCE statements to arrange that an array's first element was at index zero, but that would rely on the absence of array bound checking and is more difficult with multi-dimensional arrays. Instead, one would make do either by having a separate list length variable, or else remembering the offsets... The MODULE usage requires F90 or later and provides a convenient protocol for global data, otherwise one must mess about with COMMON or parameter hordes. If that were done, the B6700 compiler would have handled it. But for the benefit of trembling modern compilers it also contains the fearsome new attribute, RECURSIVE, to flog the compilers into what was formalised for Algol in 1960 and was available ''for free'' via Burroughs in the 1970s. |
||
On the other hand, the early-style Fortran DO-loop would always execute once, because the test was made only at the end of an iteration, and here, routine JANE does not know the value of MAXLEVEL until ''after'' the first iteration. Code such as < |
On the other hand, the early-style Fortran DO-loop would always execute once, because the test was made only at the end of an iteration, and here, routine JANE does not know the value of MAXLEVEL until ''after'' the first iteration. Code such as <syntaxhighlight lang="fortran"> |
||
DO GASP = 1,MAXLEVEL |
DO GASP = 1,MAXLEVEL |
||
CALL TARZAN(1,HOW) |
CALL TARZAN(1,HOW) |
||
END DO</ |
END DO</syntaxhighlight> |
||
Would not work with modern Fortran, because the usual approach is to calculate the iteration count from the DO-loop parameters at the ''start'' of the DO-loop, and possibly not execute it at all if that count is not positive. This also means that with each iteration, the count must be decremented ''and'' the index variable adjusted; extra effort. There is no equivalent of Pascal's <code>Repeat ... until ''condition'';</code>, so, in place of a nice "structured" statement with clear interpretation, there is some messy code with a label and a GO TO, oh dear. |
Would not work with modern Fortran, because the usual approach is to calculate the iteration count from the DO-loop parameters at the ''start'' of the DO-loop, and possibly not execute it at all if that count is not positive. This also means that with each iteration, the count must be decremented ''and'' the index variable adjusted; extra effort. There is no equivalent of Pascal's <code>Repeat ... until ''condition'';</code>, so, in place of a nice "structured" statement with clear interpretation, there is some messy code with a label and a GO TO, oh dear. |
||
===Source=== |
===Source=== |
||
<syntaxhighlight lang="fortran"> |
|||
<lang Fortran> |
|||
MODULE ARAUCARIA !Cunning crosswords, also. |
MODULE ARAUCARIA !Cunning crosswords, also. |
||
INTEGER ENUFF !To suit the set example. |
INTEGER ENUFF !To suit the set example. |
||
Line 4,668: | Line 5,406: | ||
CALL JANE("LEVEL") !Alternatively... |
CALL JANE("LEVEL") !Alternatively... |
||
END !So much for that. |
END !So much for that. |
||
</syntaxhighlight> |
|||
</lang> |
|||
===Output=== |
===Output=== |
||
Alternately GORILLA-style, and JANE-style: |
Alternately GORILLA-style, and JANE-style: |
||
Line 4,687: | Line 5,425: | ||
=={{header|FreeBASIC}}== |
=={{header|FreeBASIC}}== |
||
< |
<syntaxhighlight lang="freebasic"> |
||
#define NULL 0 |
#define NULL 0 |
||
Line 4,760: | Line 5,498: | ||
Wend |
Wend |
||
End Sub |
End Sub |
||
</syntaxhighlight> |
|||
</lang> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
Line 4,772: | Line 5,510: | ||
=={{header|FunL}}== |
=={{header|FunL}}== |
||
{{trans|Haskell}} |
{{trans|Haskell}} |
||
< |
<syntaxhighlight lang="funl">data Tree = Empty | Node( value, left, right ) |
||
def |
def |
||
Line 4,807: | Line 5,545: | ||
println( inorder(tree) ) |
println( inorder(tree) ) |
||
println( postorder(tree) ) |
println( postorder(tree) ) |
||
println( levelorder(tree) )</ |
println( levelorder(tree) )</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
Line 4,820: | Line 5,558: | ||
=={{header|Fōrmulæ}}== |
=={{header|Fōrmulæ}}== |
||
{{FormulaeEntry|page=https://formulae.org/?script=examples/Tree_traversal}} |
|||
Fōrmulæ programs are not textual, visualization/edition of programs is done showing/manipulating structures but not text. Moreover, there can be multiple visual representations of the same program. Even though it is possible to have textual representation —i.e. XML, JSON— they are intended for storage and transfer purposes more than visualization and edition. |
|||
'''Solution''' |
|||
Notice that the action to do when visiting a node is provided as a lambda expression: |
|||
[[File:Fōrmulæ - Tree traversal 01.png]] |
|||
[[File:Fōrmulæ - Tree traversal 02.png]] |
|||
[[File:Fōrmulæ - Tree traversal 03.png]] |
|||
[[File:Fōrmulæ - Tree traversal 04.png]] |
|||
'''Test case for pre-order''' |
|||
[[File:Fōrmulæ - Tree traversal 05.png]] |
|||
[[File:Fōrmulæ - Tree traversal 06.png]] |
|||
'''Test case for in-order''' |
|||
[[File:Fōrmulæ - Tree traversal 07.png]] |
|||
[[File:Fōrmulæ - Tree traversal 08.png]] |
|||
'''Test case for post-order''' |
|||
[[File:Fōrmulæ - Tree traversal 09.png]] |
|||
[[File:Fōrmulæ - Tree traversal 10.png]] |
|||
'''Test case for breadth-first search''' |
|||
[[File:Fōrmulæ - Tree traversal 11.png]] |
|||
Programs in Fōrmulæ are created/edited online in its [https://formulae.org website], However they run on execution servers. By default remote servers are used, but they are limited in memory and processing power, since they are intended for demonstration and casual use. A local server can be downloaded and installed, it has no limitations (it runs in your own computer). Because of that, example programs can be fully visualized and edited, but some of them will not run if they require a moderate or heavy computation/memory resources, and no local server is being used. |
|||
[[File:Fōrmulæ - Tree traversal 12.png]] |
|||
In '''[https://formulae.org/?example=Tree_traversal this]''' page you can see the program(s) related to this task and their results. |
|||
=={{header|GFA Basic}}== |
=={{header|GFA Basic}}== |
||
<syntaxhighlight lang="basic"> |
|||
<lang> |
|||
maxnodes%=100 ! set a limit to size of tree |
maxnodes%=100 ! set a limit to size of tree |
||
content%=0 ! index of content field |
content%=0 ! index of content field |
||
Line 4,945: | Line 5,715: | ||
WEND |
WEND |
||
RETURN |
RETURN |
||
</syntaxhighlight> |
|||
</lang> |
|||
=={{header|Go}}== |
=={{header|Go}}== |
||
Line 4,951: | Line 5,721: | ||
{{trans|C}} |
{{trans|C}} |
||
This is like many examples on this page. |
This is like many examples on this page. |
||
< |
<syntaxhighlight lang="go">package main |
||
import "fmt" |
import "fmt" |
||
Line 5,036: | Line 5,806: | ||
func visitor(value int) { |
func visitor(value int) { |
||
fmt.Print(value, " ") |
fmt.Print(value, " ") |
||
}</ |
}</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
Line 5,046: | Line 5,816: | ||
===Flat slice=== |
===Flat slice=== |
||
Alternative representation. Like Wikipedia [http://en.wikipedia.org/wiki/Binary_tree#Arrays Binary tree#Arrays] |
Alternative representation. Like Wikipedia [http://en.wikipedia.org/wiki/Binary_tree#Arrays Binary tree#Arrays] |
||
< |
<syntaxhighlight lang="go">package main |
||
import "fmt" |
import "fmt" |
||
Line 5,116: | Line 5,886: | ||
} |
} |
||
} |
} |
||
}</ |
}</syntaxhighlight> |
||
=={{header|Groovy}}== |
=={{header|Groovy}}== |
||
Uses Groovy '''Node''' and '''NodeBuilder''' classes |
Uses Groovy '''Node''' and '''NodeBuilder''' classes |
||
< |
<syntaxhighlight lang="groovy">def preorder; |
||
preorder = { Node node -> |
preorder = { Node node -> |
||
([node] + node.children().collect { preorder(it) }).flatten() |
([node] + node.children().collect { preorder(it) }).flatten() |
||
Line 5,154: | Line 5,924: | ||
node |
node |
||
} |
} |
||
}</ |
}</syntaxhighlight> |
||
Verify that '''BinaryNodeBuilder''' will not allow a node to have more than 2 children |
Verify that '''BinaryNodeBuilder''' will not allow a node to have more than 2 children |
||
< |
<syntaxhighlight lang="groovy">try { |
||
new BinaryNodeBuilder().'1' { |
new BinaryNodeBuilder().'1' { |
||
a {} |
a {} |
||
Line 5,166: | Line 5,936: | ||
} catch (org.codehaus.groovy.transform.powerassert.PowerAssertionError e) { |
} catch (org.codehaus.groovy.transform.powerassert.PowerAssertionError e) { |
||
println 'limited to binary tree\r\n' |
println 'limited to binary tree\r\n' |
||
}</ |
}</syntaxhighlight> |
||
Test case #1 (from the task definition) |
Test case #1 (from the task definition) |
||
< |
<syntaxhighlight lang="groovy">// 1 |
||
// / \ |
// / \ |
||
// 2 3 |
// 2 3 |
||
Line 5,185: | Line 5,955: | ||
'6' { '8' {}; '9' {} } |
'6' { '8' {}; '9' {} } |
||
} |
} |
||
}</ |
}</syntaxhighlight> |
||
Test case #2 (tests single right child) |
Test case #2 (tests single right child) |
||
< |
<syntaxhighlight lang="groovy">// 1 |
||
// / \ |
// / \ |
||
// 2 3 |
// 2 3 |
||
Line 5,204: | Line 5,974: | ||
'6' { '8' {}; '9' {} } |
'6' { '8' {}; '9' {} } |
||
} |
} |
||
}</ |
}</syntaxhighlight> |
||
Run tests: |
Run tests: |
||
< |
<syntaxhighlight lang="groovy">def test = { tree -> |
||
println "preorder: ${preorder(tree).collect{it.name()}}" |
println "preorder: ${preorder(tree).collect{it.name()}}" |
||
println "preorder: ${tree.depthFirst().collect{it.name()}}" |
println "preorder: ${tree.depthFirst().collect{it.name()}}" |
||
Line 5,221: | Line 5,991: | ||
} |
} |
||
test(tree1) |
test(tree1) |
||
test(tree2)</ |
test(tree2)</syntaxhighlight> |
||
Output: |
Output: |
||
Line 5,242: | Line 6,012: | ||
=={{header|Haskell}}== |
=={{header|Haskell}}== |
||
===Left Right nodes=== |
===Left Right nodes=== |
||
< |
<syntaxhighlight lang="haskell">---------------------- TREE TRAVERSAL -------------------- |
||
data Tree a |
data Tree a |
||
Line 5,311: | Line 6,081: | ||
([preorder, inorder, postorder, levelorder] <*> [tree]) |
([preorder, inorder, postorder, levelorder] <*> [tree]) |
||
where |
where |
||
justifyLeft n c s = take n (s <> replicate n c)</ |
justifyLeft n c s = take n (s <> replicate n c)</syntaxhighlight> |
||
{{Out}} |
{{Out}} |
||
<pre> 1 |
<pre> 1 |
||
Line 5,332: | Line 6,102: | ||
{{Trans|Python}} |
{{Trans|Python}} |
||
<lang |
<syntaxhighlight lang="haskell">import Data.Bool (bool) |
||
import Data.Tree (Tree (..), drawForest, drawTree, foldTree) |
|||
---------------------- TREE TRAVERSAL -------------------- |
---------------------- TREE TRAVERSAL -------------------- |
||
Line 5,365: | Line 6,136: | ||
Int -> [Int] -> Int |
Int -> [Int] -> Int |
||
nodeCount = const (succ . sum) |
nodeCount = const (succ . sum) |
||
treeDepth = const (succ . foldr max 1) |
treeDepth = const (succ . foldr max 1) |
||
treeMax x xs = maximum (x : xs) |
treeMax x xs = maximum (x : xs) |
||
treeMin x xs = minimum (x : xs) |
treeMin x xs = minimum (x : xs) |
||
treeProduct x xs = x * product xs |
treeProduct x xs = x * product xs |
||
treeSum x xs = x + sum xs |
treeSum x xs = x + sum xs |
||
treeWidth _ [] = 1 |
treeWidth _ [] = 1 |
||
treeWidth _ xs = sum xs |
treeWidth _ xs = sum xs |
||
treeLeaves :: Tree a -> [a] |
treeLeaves :: Tree a -> [a] |
||
treeLeaves = go |
treeLeaves = foldTree go |
||
where |
where |
||
go |
go x [] = [x] |
||
go |
go _ xs = concat xs |
||
--------------------------- TEST ------------------------- |
--------------------------- TEST ------------------------- |
||
tree :: Tree Int |
tree :: Tree Int |
||
Line 5,424: | Line 6,189: | ||
justifyLeft, justifyRight :: Int -> Char -> String -> String |
justifyLeft, justifyRight :: Int -> Char -> String -> String |
||
justifyLeft n c s = take n (s <> replicate n c) |
justifyLeft n c s = take n (s <> replicate n c) |
||
justifyRight n c = (drop . length) <*> (replicate n c <>)</ |
justifyRight n c = (drop . length) <*> (replicate n c <>)</syntaxhighlight> |
||
<pre>1 |
<pre>1 |
||
| |
| |
||
Line 5,457: | Line 6,222: | ||
=={{header|Icon}} and {{header|Unicon}}== |
=={{header|Icon}} and {{header|Unicon}}== |
||
< |
<syntaxhighlight lang="icon">procedure main() |
||
bTree := [1, [2, [4, [7]], [5]], [3, [6, [8], [9]]]] |
bTree := [1, [2, [4, [7]], [5]], [3, [6, [8], [9]]]] |
||
showTree(bTree, preorder|inorder|postorder|levelorder) |
showTree(bTree, preorder|inorder|postorder|levelorder) |
||
Line 5,488: | Line 6,253: | ||
} |
} |
||
} |
} |
||
end</ |
end</syntaxhighlight> |
||
Output: |
Output: |
||
Line 5,500: | Line 6,265: | ||
=={{header|Isabelle}}== |
=={{header|Isabelle}}== |
||
< |
<syntaxhighlight lang="isabelle">theory Tree |
||
imports Main |
imports Main |
||
begin |
begin |
||
Line 5,507: | Line 6,272: | ||
definition example :: "int tree" where |
definition example :: "int tree" where |
||
"example |
"example = |
||
Node |
Node |
||
(Node |
(Node |
||
Line 5,529: | Line 6,294: | ||
)" |
)" |
||
fun preorder :: "'a tree |
fun preorder :: "'a tree ? 'a list" where |
||
"preorder Leaf = []" |
"preorder Leaf = []" |
||
| "preorder (Node l a r) = a # preorder l @ preorder r" |
| "preorder (Node l a r) = a # preorder l @ preorder r" |
||
Line 5,535: | Line 6,300: | ||
lemma "preorder example = [1, 2, 4, 7, 5, 3, 6, 8, 9]" by code_simp |
lemma "preorder example = [1, 2, 4, 7, 5, 3, 6, 8, 9]" by code_simp |
||
fun inorder :: "'a tree |
fun inorder :: "'a tree ? 'a list" where |
||
"inorder Leaf = []" |
"inorder Leaf = []" |
||
| "inorder (Node l a r) = inorder l @ [a] @ inorder r" |
| "inorder (Node l a r) = inorder l @ [a] @ inorder r" |
||
Line 5,541: | Line 6,306: | ||
lemma "inorder example = [7, 4, 2, 5, 1, 8, 6, 9, 3]" by code_simp |
lemma "inorder example = [7, 4, 2, 5, 1, 8, 6, 9, 3]" by code_simp |
||
fun postorder :: "'a tree |
fun postorder :: "'a tree ? 'a list" where |
||
"postorder Leaf = []" |
"postorder Leaf = []" |
||
| "postorder (Node l a r) = postorder l @ postorder r @ [a]" |
| "postorder (Node l a r) = postorder l @ postorder r @ [a]" |
||
Line 5,561: | Line 6,326: | ||
so we provide some help by defining what the size of a tree is. |
so we provide some help by defining what the size of a tree is. |
||
› |
› |
||
fun tree_size :: "'a tree |
fun tree_size :: "'a tree ? nat" where |
||
"tree_size Leaf = 1" |
"tree_size Leaf = 1" |
||
| "tree_size (Node l _ r) = 1 + tree_size l + tree_size r" |
| "tree_size (Node l _ r) = 1 + tree_size l + tree_size r" |
||
function (sequential) bfs :: "'a tree list |
function (sequential) bfs :: "'a tree list ? 'a list" where |
||
"bfs [] = []" |
"bfs [] = []" |
||
| "bfs (Leaf#q) = bfs q" |
| "bfs (Leaf#q) = bfs q" |
||
Line 5,571: | Line 6,336: | ||
by pat_completeness auto |
by pat_completeness auto |
||
termination bfs |
termination bfs |
||
by(relation "measure ( |
by(relation "measure (?qs. sum_list (map tree_size qs))") simp+ |
||
fun levelorder :: "'a tree |
fun levelorder :: "'a tree ? 'a list" where |
||
"levelorder t = bfs [t]" |
"levelorder t = bfs [t]" |
||
lemma "levelorder example = [1, 2, 3, 4, 5, 6, 7, 8, 9]" by code_simp |
lemma "levelorder example = [1, 2, 3, 4, 5, 6, 7, 8, 9]" by code_simp |
||
end</ |
end</syntaxhighlight> |
||
=={{header|J}}== |
=={{header|J}}== |
||
< |
<syntaxhighlight lang="j">preorder=: ]S:0 |
||
postorder=: ([:; postorder&.>@}.) , >@{. |
postorder=: ([:; postorder&.>@}.) , >@{. |
||
levelorder=: ;@({::L:1 _~ [: (/: #@>) <S:1@{::) |
levelorder=: ;@({::L:1 _~ [: (/: #@>) <S:1@{::) |
||
inorder=: ([:; inorder&.>@(''"_`(1&{)@.(1<#))) , >@{. , [:; inorder&.>@}.@}.</ |
inorder=: ([:; inorder&.>@(''"_`(1&{)@.(1<#))) , >@{. , [:; inorder&.>@}.@}.</syntaxhighlight> |
||
Required example: |
Required example: |
||
< |
<syntaxhighlight lang="j">N2=: conjunction def '(<m),(<n),<y' |
||
N1=: adverb def '(<m),<y' |
N1=: adverb def '(<m),<y' |
||
L=: adverb def '<m' |
L=: adverb def '<m' |
||
tree=: 1 N2 (2 N2 (4 N1 (7 L)) 5 L) 3 N1 6 N2 (8 L) 9 L</ |
tree=: 1 N2 (2 N2 (4 N1 (7 L)) 5 L) 3 N1 6 N2 (8 L) 9 L</syntaxhighlight> |
||
This tree is organized in a pre-order fashion |
This tree is organized in a pre-order fashion |
||
< |
<syntaxhighlight lang="j"> preorder tree |
||
1 2 4 7 5 3 6 8 9</ |
1 2 4 7 5 3 6 8 9</syntaxhighlight> |
||
post-order is not that much different from pre-order, except that the children must extracted before the parent. |
post-order is not that much different from pre-order, except that the children must extracted before the parent. |
||
< |
<syntaxhighlight lang="j"> postorder tree |
||
7 4 5 2 8 9 6 3 1</ |
7 4 5 2 8 9 6 3 1</syntaxhighlight> |
||
Implementing in-order is more complex because we must sometimes test whether we have any leaves, instead of relying on J's implicit looping over lists |
Implementing in-order is more complex because we must sometimes test whether we have any leaves, instead of relying on J's implicit looping over lists |
||
< |
<syntaxhighlight lang="j"> inorder tree |
||
7 4 2 5 1 8 6 9 3</ |
7 4 2 5 1 8 6 9 3</syntaxhighlight> |
||
level-order can be accomplished by constructing a map of the locations of the leaves, sorting these map locations by their non-leaf indices and using the result to extract all leaves from the tree. Elements at the same level with the same parent will have the same sort keys and thus be extracted in preorder fashion, which works just fine. |
level-order can be accomplished by constructing a map of the locations of the leaves, sorting these map locations by their non-leaf indices and using the result to extract all leaves from the tree. Elements at the same level with the same parent will have the same sort keys and thus be extracted in preorder fashion, which works just fine. |
||
< |
<syntaxhighlight lang="j"> levelorder tree |
||
1 2 3 4 5 6 7 8 9</ |
1 2 3 4 5 6 7 8 9</syntaxhighlight> |
||
For J novices, here's the tree instance with a few redundant parenthesis: |
For J novices, here's the tree instance with a few redundant parenthesis: |
||
< |
<syntaxhighlight lang="j"> tree=: 1 N2 (2 N2 (4 N1 (7 L)) (5 L)) (3 N1 (6 N2 (8 L) (9 L)))</syntaxhighlight> |
||
Syntactically, N2 is a binary node expressed as <code>m N2 n y</code>. N1 is a node with a single child, expressed as <code>m N2 y</code>. L is a leaf node, expressed as <code>m L</code>. In all three cases, the parent value (<code>m</code>) for the node appears on the left, and the child tree(s) appear on the right. (And <code>n</code> must be parenthesized if it is not a single word.) |
Syntactically, N2 is a binary node expressed as <code>m N2 n y</code>. N1 is a node with a single child, expressed as <code>m N2 y</code>. L is a leaf node, expressed as <code>m L</code>. In all three cases, the parent value (<code>m</code>) for the node appears on the left, and the child tree(s) appear on the right. (And <code>n</code> must be parenthesized if it is not a single word.) |
||
Line 5,626: | Line 6,391: | ||
Of course, there are other ways of representing tree structures in J. One fairly natural approach pairs a list of data with a matching list of parent indices. For example: |
Of course, there are other ways of representing tree structures in J. One fairly natural approach pairs a list of data with a matching list of parent indices. For example: |
||
< |
<syntaxhighlight lang="j">example=:1 8 3 4 7 5 9 6 2,: 0 7 0 8 3 8 7 2 0</syntaxhighlight> |
||
Here, we have two possible ways of identifying the root node. It can be in a known place in the list (index 0, for this example). But it is also the only node which is its own parent. For this task we'll use the more general (and thus slower) approach which allows us to place the root node anywhere in the sequence. |
Here, we have two possible ways of identifying the root node. It can be in a known place in the list (index 0, for this example). But it is also the only node which is its own parent. For this task we'll use the more general (and thus slower) approach which allows us to place the root node anywhere in the sequence. |
||
Line 5,632: | Line 6,397: | ||
Next, let's define a few utilities: |
Next, let's define a few utilities: |
||
< |
<syntaxhighlight lang="j">depth=: +/@((~: , (~: i.@#@{.)~) {:@,)@({~^:a:) |
||
reorder=:4 :0 |
reorder=:4 :0 |
||
Line 5,644: | Line 6,409: | ||
parent=:3 :'parent[''data parent''=. y' |
parent=:3 :'parent[''data parent''=. y' |
||
childinds=: [: <:@(2&{.@-.&> #\) (</. #\)`(]~.)`(a:"0)}~</ |
childinds=: [: <:@(2&{.@-.&> #\) (</. #\)`(]~.)`(a:"0)}~</syntaxhighlight> |
||
Here, <code>data</code> extracts the list of data items from the tree and <code>parent</code> extracts the structure from the tree. |
Here, <code>data</code> extracts the list of data items from the tree and <code>parent</code> extracts the structure from the tree. |
||
Line 5,656: | Line 6,421: | ||
Next, we define our "traversal" routines (actually, we are going a bit overboard here - we really only need to extract the data for this tasks's concept of traversal): |
Next, we define our "traversal" routines (actually, we are going a bit overboard here - we really only need to extract the data for this tasks's concept of traversal): |
||
< |
<syntaxhighlight lang="j">dataorder=: /:@data reorder ] |
||
levelorder=: /:@depth@parent reorder ] |
levelorder=: /:@depth@parent reorder ] |
||
Line 5,708: | Line 6,473: | ||
todo=. todo,|.ch end. end. |
todo=. todo,|.ch end. end. |
||
r |
r |
||
)</ |
)</syntaxhighlight> |
||
These routines assume that children of a node are arranged so that the lower index appears to the left of the higher index. If instead we wanted to rely on the ordering of their values, we could first use <code>dataorder</code> to enforce the assumption that child indexes are ordered properly. |
These routines assume that children of a node are arranged so that the lower index appears to the left of the higher index. If instead we wanted to rely on the ordering of their values, we could first use <code>dataorder</code> to enforce the assumption that child indexes are ordered properly. |
||
Line 5,714: | Line 6,479: | ||
Example use: |
Example use: |
||
< |
<syntaxhighlight lang="j"> levelorder dataorder example |
||
1 2 3 4 5 6 7 8 9 |
1 2 3 4 5 6 7 8 9 |
||
0 0 0 1 1 2 3 5 5 |
0 0 0 1 1 2 3 5 5 |
||
Line 5,725: | Line 6,490: | ||
postorder dataorder example |
postorder dataorder example |
||
7 4 5 2 8 9 6 3 1 |
7 4 5 2 8 9 6 3 1 |
||
1 3 3 8 6 6 7 8 8</ |
1 3 3 8 6 6 7 8 8</syntaxhighlight> |
||
(Once again, all we really need for this task is the first row of those results - the part that represents data.) |
(Once again, all we really need for this task is the first row of those results - the part that represents data.) |
||
Line 5,737: | Line 6,502: | ||
{{works with|Java|1.5+}} |
{{works with|Java|1.5+}} |
||
< |
<syntaxhighlight lang="java5">import java.util.*; |
||
public class TreeTraversal { |
public class TreeTraversal { |
||
Line 5,823: | Line 6,588: | ||
} |
} |
||
}</ |
}</syntaxhighlight> |
||
Output: |
Output: |
||
<pre>1 2 4 7 5 3 6 8 9 |
<pre>1 2 4 7 5 3 6 8 9 |
||
Line 5,838: | Line 6,603: | ||
{{works with|Java|1.8+}} |
{{works with|Java|1.8+}} |
||
< |
<syntaxhighlight lang="java5">import java.util.function.Consumer; |
||
import java.util.Queue; |
import java.util.Queue; |
||
import java.util.LinkedList; |
import java.util.LinkedList; |
||
Line 5,963: | Line 6,728: | ||
System.out.println(); |
System.out.println(); |
||
} |
} |
||
}</ |
}</syntaxhighlight> |
||
Output: |
Output: |
||
Line 5,975: | Line 6,740: | ||
====Iteration==== |
====Iteration==== |
||
inspired by [[#Ruby|Ruby]] |
inspired by [[#Ruby|Ruby]] |
||
< |
<syntaxhighlight lang="javascript">function BinaryTree(value, left, right) { |
||
this.value = value; |
this.value = value; |
||
this.left = left; |
this.left = left; |
||
Line 6,014: | Line 6,779: | ||
print("*** inorder ***"); tree.inorder(print); |
print("*** inorder ***"); tree.inorder(print); |
||
print("*** postorder ***"); tree.postorder(print); |
print("*** postorder ***"); tree.postorder(print); |
||
print("*** levelorder ***"); tree.levelorder(print);</ |
print("*** levelorder ***"); tree.levelorder(print);</syntaxhighlight> |
||
====Functional composition==== |
====Functional composition==== |
||
Line 6,020: | Line 6,785: | ||
(for binary trees consisting of nested lists) |
(for binary trees consisting of nested lists) |
||
< |
<syntaxhighlight lang="javascript">(function () { |
||
function preorder(n) { |
function preorder(n) { |
||
Line 6,108: | Line 6,873: | ||
return wikiTable(lstTest, true) + '\n\n' + JSON.stringify(lstTest); |
return wikiTable(lstTest, true) + '\n\n' + JSON.stringify(lstTest); |
||
})();</ |
})();</syntaxhighlight> |
||
Output: |
Output: |
||
Line 6,125: | Line 6,890: | ||
|} |
|} |
||
< |
<syntaxhighlight lang="javascript">[["Traversal","Nodes visited"], |
||
["preorder",[1,2,4,7,5,3,6,8,9]],["inorder",[7,4,2,5,1,8,6,9,3]], |
["preorder",[1,2,4,7,5,3,6,8,9]],["inorder",[7,4,2,5,1,8,6,9,3]], |
||
["postorder",[7,4,5,2,8,9,6,3,1]],["levelorder",[1,2,3,4,5,6,7,8,9]]]</ |
["postorder",[7,4,5,2,8,9,6,3,1]],["levelorder",[1,2,3,4,5,6,7,8,9]]]</syntaxhighlight> |
||
Line 6,137: | Line 6,902: | ||
< |
<syntaxhighlight lang="javascript">(function () { |
||
'use strict'; |
'use strict'; |
||
Line 6,257: | Line 7,022: | ||
}, {}); |
}, {}); |
||
})();</ |
})();</syntaxhighlight> |
||
{{Out}} |
{{Out}} |
||
< |
<syntaxhighlight lang="javascript">{"preorder":[1, 2, 4, 7, 5, 3, 6, 8, 9], |
||
"inorder":[7, 4, 2, 5, 1, 8, 6, 9, 3], |
"inorder":[7, 4, 2, 5, 1, 8, 6, 9, 3], |
||
"postorder":[7, 4, 5, 2, 8, 9, 6, 3, 1], |
"postorder":[7, 4, 5, 2, 8, 9, 6, 3, 1], |
||
"level-order":[1, 2, 3, 4, 5, 6, 7, 8, 9]}</ |
"level-order":[1, 2, 3, 4, 5, 6, 7, 8, 9]}</syntaxhighlight> |
||
===ES6=== |
===ES6=== |
||
Line 6,268: | Line 7,033: | ||
{{Trans|Haskell}} |
{{Trans|Haskell}} |
||
{{Trans|Python}} |
{{Trans|Python}} |
||
< |
<syntaxhighlight lang="javascript">(() => { |
||
"use strict"; |
"use strict"; |
||
Line 6,314: | Line 7,079: | ||
// task: 'Visualize a tree' |
// task: 'Visualize a tree' |
||
console.log([ |
console.log([ |
||
" |
" + 4 - 7", |
||
" |
" + 2 ¦", |
||
" |
" ¦ + 5", |
||
" 1 |
" 1 ¦", |
||
" |
" ¦ + 8", |
||
" |
" + 3 - 6 ¦", |
||
" |
" + 9" |
||
].join("\n")); |
].join("\n")); |
||
Line 6,395: | Line 7,160: | ||
// MAIN --- |
// MAIN --- |
||
return main(); |
return main(); |
||
})();</ |
})();</syntaxhighlight> |
||
{{Out}} |
{{Out}} |
||
<pre> |
<pre> + 4 - 7 |
||
+ 2 ¦ |
|||
¦ + 5 |
|||
1 |
1 ¦ |
||
¦ + 8 |
|||
+ 3 - 6 ¦ |
|||
+ 9 |
|||
preorder: 1,2,4,7,5,3,6,8,9 |
preorder: 1,2,4,7,5,3,6,8,9 |
||
inorder: 7,4,2,5,1,8,6,9,3 |
inorder: 7,4,2,5,1,8,6,9,3 |
||
Line 6,413: | Line 7,178: | ||
The implementation assumes an array structured recursively as [ node, left, right ], where "left" and "right" may be [] or null equivalently. |
The implementation assumes an array structured recursively as [ node, left, right ], where "left" and "right" may be [] or null equivalently. |
||
< |
<syntaxhighlight lang="jq">def preorder: |
||
if length == 0 then empty |
if length == 0 then empty |
||
else .[0], (.[1]|preorder), (.[2]|preorder) |
else .[0], (.[1]|preorder), (.[2]|preorder) |
||
Line 6,439: | Line 7,204: | ||
def levelorder: [.] | recurse( tails ) | heads; |
def levelorder: [.] | recurse( tails ) | heads; |
||
</syntaxhighlight> |
|||
</lang> |
|||
'''The task''': |
'''The task''': |
||
< |
<syntaxhighlight lang="jq">def task: |
||
# [node, left, right] |
# [node, left, right] |
||
def atree: [1, [2, [4, [7,[],[]], |
def atree: [1, [2, [4, [7,[],[]], |
||
Line 6,457: | Line 7,222: | ||
; |
; |
||
task</ |
task</syntaxhighlight> |
||
{{Out}} |
{{Out}} |
||
$ jq -n -c -r -f Tree_traversal.jq |
$ jq -n -c -r -f Tree_traversal.jq |
||
Line 6,466: | Line 7,231: | ||
=={{header|Julia}}== |
=={{header|Julia}}== |
||
< |
<syntaxhighlight lang="julia">tree = Any[1, Any[2, Any[4, Any[7, Any[], |
||
Any[]], |
Any[]], |
||
Any[]], |
Any[]], |
||
Line 6,492: | Line 7,257: | ||
t = mapreduce(x -> isa(x, Number) ? (f(x); []) : x, vcat, t) |
t = mapreduce(x -> isa(x, Number) ? (f(x); []) : x, vcat, t) |
||
end |
end |
||
</syntaxhighlight> |
|||
</lang> |
|||
{{Out}} |
{{Out}} |
||
Line 6,507: | Line 7,272: | ||
=={{header|Kotlin}}== |
=={{header|Kotlin}}== |
||
===procedural style=== |
===procedural style=== |
||
< |
<syntaxhighlight lang="scala">data class Node(val v: Int, var left: Node? = null, var right: Node? = null) { |
||
override fun toString() = "$v" |
override fun toString() = "$v" |
||
} |
} |
||
Line 6,573: | Line 7,338: | ||
exec(" postOrder: ", nodes[1], ::postOrder) |
exec(" postOrder: ", nodes[1], ::postOrder) |
||
exec("level-order: ", nodes[1], ::levelOrder) |
exec("level-order: ", nodes[1], ::levelOrder) |
||
}</ |
}</syntaxhighlight> |
||
{{Out}} |
{{Out}} |
||
Line 6,584: | Line 7,349: | ||
===object-oriented style=== |
===object-oriented style=== |
||
< |
<syntaxhighlight lang="scala">fun main(args: Array<String>) { |
||
data class Node(val v: Int, var left: Node? = null, var right: Node? = null) { |
data class Node(val v: Int, var left: Node? = null, var right: Node? = null) { |
||
override fun toString() = " $v" |
override fun toString() = " $v" |
||
Line 6,625: | Line 7,390: | ||
exec("level-order:", Node::levelOrder) |
exec("level-order:", Node::levelOrder) |
||
} |
} |
||
}</ |
}</syntaxhighlight> |
||
=={{header|Lambdatalk}}== |
=={{header|Lambdatalk}}== |
||
Line 6,638: | Line 7,403: | ||
- {A.get index array} gets the value of array at index |
- {A.get index array} gets the value of array at index |
||
</pre> |
</pre> |
||
< |
<syntaxhighlight lang="scheme"> |
||
{def walk |
{def walk |
||
Line 6,673: | Line 7,438: | ||
{sort < {T}} -> 1 2 3 4 5 6 7 8 9 |
{sort < {T}} -> 1 2 3 4 5 6 7 8 9 |
||
{sort > {T}} -> 9 8 7 6 5 4 3 2 1 |
{sort > {T}} -> 9 8 7 6 5 4 3 2 1 |
||
</syntaxhighlight> |
|||
</lang> |
|||
=={{header|Lingo}}== |
=={{header|Lingo}}== |
||
< |
<syntaxhighlight lang="lingo">-- parent script "BinaryTreeNode" |
||
property _val, _left, _right |
property _val, _left, _right |
||
Line 6,703: | Line 7,468: | ||
on getRight (me) |
on getRight (me) |
||
return me._right |
return me._right |
||
end</ |
end</syntaxhighlight> |
||
< |
<syntaxhighlight lang="lingo">-- parent script "BinaryTreeTraversal" |
||
on inOrder (me, node, l) |
on inOrder (me, node, l) |
||
Line 6,755: | Line 7,520: | ||
delete the last char of str |
delete the last char of str |
||
return str |
return str |
||
end</ |
end</syntaxhighlight> |
||
Usage: |
Usage: |
||
< |
<syntaxhighlight lang="lingo">-- create the tree |
||
l = [] |
l = [] |
||
repeat with i = 1 to 10 |
repeat with i = 1 to 10 |
||
Line 6,777: | Line 7,542: | ||
put "inorder: " & trav.serialize(trav.inOrder(l[1])) |
put "inorder: " & trav.serialize(trav.inOrder(l[1])) |
||
put "postorder: " & trav.serialize(trav.postOrder(l[1])) |
put "postorder: " & trav.serialize(trav.postOrder(l[1])) |
||
put "level-order: " & trav.serialize(trav.levelOrder(l[1]))</ |
put "level-order: " & trav.serialize(trav.levelOrder(l[1]))</syntaxhighlight> |
||
{{Out}} |
{{Out}} |
||
Line 6,788: | Line 7,553: | ||
=={{header|Logo}}== |
=={{header|Logo}}== |
||
< |
<syntaxhighlight lang="logo">; nodes are [data left right], use "first" to get data |
||
to node.left :node |
to node.left :node |
||
Line 6,844: | Line 7,609: | ||
in.order :tree [(type ? "| |)] (print) |
in.order :tree [(type ? "| |)] (print) |
||
post.order :tree [(type ? "| |)] (print) |
post.order :tree [(type ? "| |)] (print) |
||
level.order :tree [(type ? "| |)] (print)</ |
level.order :tree [(type ? "| |)] (print)</syntaxhighlight> |
||
=={{header|Logtalk}}== |
=={{header|Logtalk}}== |
||
< |
<syntaxhighlight lang="logtalk"> |
||
:- object(tree_traversal). |
:- object(tree_traversal). |
||
Line 6,928: | Line 7,693: | ||
:- end_object. |
:- end_object. |
||
</syntaxhighlight> |
|||
</lang> |
|||
Sample output: |
Sample output: |
||
< |
<syntaxhighlight lang="text"> |
||
| ?- ?- tree_traversal::orders. |
| ?- ?- tree_traversal::orders. |
||
Pre-order: 1 2 4 7 5 3 6 8 9 |
Pre-order: 1 2 4 7 5 3 6 8 9 |
||
Line 6,937: | Line 7,702: | ||
Level-order: 1 2 3 4 5 6 7 8 9 |
Level-order: 1 2 3 4 5 6 7 8 9 |
||
yes |
yes |
||
</syntaxhighlight> |
|||
</lang> |
|||
=={{header|Lua}}== |
=={{header|Lua}}== |
||
<syntaxhighlight lang="lua"> |
|||
<lang Lua>-- Utility |
|||
local function |
local function depth_first(tr, a, b, c, flat_list) |
||
for _, val in ipairs({a, b, c}) do |
|||
if type(tr[val]) == "table" then |
|||
table.insert(t1, v) |
|||
depth_first(tr[val], a, b, c, flat_list) |
|||
end |
|||
elseif type(tr[val]) ~= "nil" then |
|||
end |
|||
table.insert(flat_list, tr[val]) |
|||
end -- if |
|||
-- Node class |
|||
end -- for |
|||
local Node = {} |
|||
return flat_list |
|||
Node.__index = Node |
|||
function Node:order(order) |
|||
local r = {} |
|||
append(r, type(self[order[1]]) == "table" and self[order[1]]:order(order) or {self[order[1]]}) |
|||
append(r, type(self[order[2]]) == "table" and self[order[2]]:order(order) or {self[order[2]]}) |
|||
append(r, type(self[order[3]]) == "table" and self[order[3]]:order(order) or {self[order[3]]}) |
|||
return r |
|||
end |
|||
function Node:levelorder() |
|||
local levelorder = {} |
|||
local queue = {self} |
|||
while next(queue) do |
|||
local node = table.remove(queue, 1) |
|||
table.insert(levelorder, node[1]) |
|||
table.insert(queue, node[2]) |
|||
table.insert(queue, node[3]) |
|||
end |
|||
return levelorder |
|||
end |
end |
||
local function flatten_pre_order(tr) return depth_first(tr, 1, 2, 3, {}) end |
|||
local function flatten_in_order(tr) return depth_first(tr, 2, 1, 3, {}) end |
|||
local function flatten_post_order(tr) return depth_first(tr, 2, 3, 1, {}) end |
|||
local function flatten_level_order(tr) |
|||
-- Node creator |
|||
local flat_list, queue = {}, {tr} |
|||
local function new(value, left, right) |
|||
while next(queue) do -- while queue is not empty |
|||
return value and setmetatable({ |
|||
local node = table.remove(queue, 1) -- dequeue |
|||
value, |
|||
if type(node) == "table" then |
|||
table.insert(flat_list, node[1]) |
|||
(type(right) == "table") and new(unpack(right)) or new(right), |
|||
table.insert(queue, node[2]) -- enqueue |
|||
}, Node) or nil |
|||
table.insert(queue, node[3]) -- enqueue |
|||
else |
|||
table.insert(flat_list, node) |
|||
end -- if |
|||
end -- while |
|||
return flat_list |
|||
end |
end |
||
-- Example |
-- Example |
||
local tree = |
local tree = {1, {2, {4, 7}, 5}, {3, {6, 8, 9}}} |
||
print(" |
print("Pre order: " .. table.concat(flatten_pre_order(tree), " ")) |
||
print(" |
print("In order: " .. table.concat(flatten_in_order(tree), " ")) |
||
print(" |
print("Post order: " .. table.concat(flatten_post_order(tree), " ")) |
||
print(" |
print("Level order: " .. table.concat(flatten_level_order(tree), " ")) |
||
</syntaxhighlight> |
|||
=={{header|M2000 Interpreter}}== |
=={{header|M2000 Interpreter}}== |
||
Line 6,991: | Line 7,747: | ||
A tuple is an "auto array" in M2000 Interpreter. (,) is the zero length array. |
A tuple is an "auto array" in M2000 Interpreter. (,) is the zero length array. |
||
<syntaxhighlight lang="m2000 interpreter"> |
|||
<lang M2000 Interpreter> |
|||
Module CheckIt { |
Module CheckIt { |
||
Null=(,) |
Null=(,) |
||
Line 7,051: | Line 7,807: | ||
} |
} |
||
CheckIt |
CheckIt |
||
</syntaxhighlight> |
|||
</lang> |
|||
===Using OOP=== |
===Using OOP=== |
||
Now tree is nodes with pointers to nodes (a node ifs a Group, the user object) |
Now tree is nodes with pointers to nodes (a node ifs a Group, the user object) |
||
The "as pointer" is optional, but we can use type check if we want. |
The "as pointer" is optional, but we can use type check if we want. |
||
<syntaxhighlight lang="m2000 interpreter"> |
|||
<lang M2000 Interpreter> |
|||
Module OOP { |
Module OOP { |
||
\\ Class is a global function (until this module end) |
\\ Class is a global function (until this module end) |
||
Line 7,140: | Line 7,896: | ||
} |
} |
||
OOP |
OOP |
||
</syntaxhighlight> |
|||
</lang> |
|||
or we can put modules inside Node Class as methods |
or we can put modules inside Node Class as methods |
||
also i put a visitor as a call back (a lambda function called as module) |
also i put a visitor as a call back (a lambda function called as module) |
||
<syntaxhighlight lang="m2000 interpreter"> |
|||
<lang M2000 Interpreter> |
|||
Module OOP { |
Module OOP { |
||
\\ Class is a global function (until this module end) |
\\ Class is a global function (until this module end) |
||
Line 7,232: | Line 7,988: | ||
} |
} |
||
OOP |
OOP |
||
</syntaxhighlight> |
|||
</lang> |
|||
Using Event object as visitor |
Using Event object as visitor |
||
<syntaxhighlight lang="m2000 interpreter"> |
|||
<lang M2000 Interpreter> |
|||
Module OOP { |
Module OOP { |
||
\\ Class is a global function (until this module end) |
\\ Class is a global function (until this module end) |
||
Line 7,327: | Line 8,083: | ||
} |
} |
||
OOP |
OOP |
||
</syntaxhighlight> |
|||
</lang> |
|||
{{out}} |
{{out}} |
||
Line 7,338: | Line 8,094: | ||
=={{header|Mathematica}}/{{header|Wolfram Language}}== |
=={{header|Mathematica}}/{{header|Wolfram Language}}== |
||
< |
<syntaxhighlight lang="mathematica">preorder[a_Integer] := a; |
||
preorder[a_[b__]] := Flatten@{a, preorder /@ {b}}; |
preorder[a_[b__]] := Flatten@{a, preorder /@ {b}}; |
||
inorder[a_Integer] := a; |
inorder[a_Integer] := a; |
||
Line 7,346: | Line 8,102: | ||
levelorder[a_] := |
levelorder[a_] := |
||
Flatten[Table[Level[a, {n}], {n, 0, Depth@a}]] /. {b_Integer[__] :> |
Flatten[Table[Level[a, {n}], {n, 0, Depth@a}]] /. {b_Integer[__] :> |
||
b};</ |
b};</syntaxhighlight> |
||
Example: |
Example: |
||
< |
<syntaxhighlight lang="mathematica">preorder[1[2[4[7], 5], 3[6[8, 9]]]] |
||
inorder[1[2[4[7], 5], 3[6[8, 9]]]] |
inorder[1[2[4[7], 5], 3[6[8, 9]]]] |
||
postorder[1[2[4[7], 5], 3[6[8, 9]]]] |
postorder[1[2[4[7], 5], 3[6[8, 9]]]] |
||
levelorder[1[2[4[7], 5], 3[6[8, 9]]]]</ |
levelorder[1[2[4[7], 5], 3[6[8, 9]]]]</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre>{1, 2, 4, 7, 5, 3, 6, 8, 9} |
<pre>{1, 2, 4, 7, 5, 3, 6, 8, 9} |
||
Line 7,360: | Line 8,116: | ||
=={{header|Mercury}}== |
=={{header|Mercury}}== |
||
< |
<syntaxhighlight lang="mercury">:- module tree_traversal. |
||
:- interface. |
:- interface. |
||
Line 7,452: | Line 8,208: | ||
print_value(V, !IO) :- |
print_value(V, !IO) :- |
||
io.print(V, !IO), |
io.print(V, !IO), |
||
io.write_string(" ", !IO).</ |
io.write_string(" ", !IO).</syntaxhighlight> |
||
Output: |
Output: |
||
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
||
Line 7,458: | Line 8,214: | ||
postorder: 7 4 5 2 8 9 6 3 1 |
postorder: 7 4 5 2 8 9 6 3 1 |
||
levelorder: 1 2 3 4 5 6 7 8 9 </pre> |
levelorder: 1 2 3 4 5 6 7 8 9 </pre> |
||
=={{header|Miranda}}== |
|||
<syntaxhighlight lang="miranda">main :: [sys_message] |
|||
main = [Stdout (lay [show (f example) |
|||
| f <- [preorder,inorder,postorder,levelorder]])] |
|||
example :: tree num |
|||
example = Node 1 (Node 2 (Node 4 (leaf 7) Nilt) |
|||
(leaf 5)) |
|||
(Node 3 (Node 6 (leaf 8) (leaf 9)) Nilt) |
|||
tree * ::= Nilt | Node * (tree *) (tree *) |
|||
leaf :: *->tree * |
|||
leaf k = Node k Nilt Nilt |
|||
preorder :: tree *->[*] |
|||
preorder Nilt = [] |
|||
preorder (Node v l r) = v : preorder l ++ preorder r |
|||
inorder :: tree *->[*] |
|||
inorder Nilt = [] |
|||
inorder (Node v l r) = inorder l ++ v : inorder r |
|||
postorder :: tree *->[*] |
|||
postorder Nilt = [] |
|||
postorder (Node v l r) = postorder l ++ postorder r ++ [v] |
|||
levelorder :: tree *->[*] |
|||
levelorder t = f [t] |
|||
where f [] = [] |
|||
f (Nilt:xs) = f xs |
|||
f (Node v l r:xs) = v : f (xs++[l,r])</syntaxhighlight> |
|||
{{out}} |
|||
<pre>[1,2,4,7,5,3,6,8,9] |
|||
[7,4,2,5,1,8,6,9,3] |
|||
[7,4,5,2,8,9,6,3,1] |
|||
[1,2,3,4,5,6,7,8,9]</pre> |
|||
=={{header|Nim}}== |
=={{header|Nim}}== |
||
< |
<syntaxhighlight lang="nim">import deques |
||
type |
type |
||
Line 7,504: | Line 8,298: | ||
echo inorder tree |
echo inorder tree |
||
echo postorder tree |
echo postorder tree |
||
echo levelorder tree</ |
echo levelorder tree</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
Line 7,513: | Line 8,307: | ||
=={{header|Objeck}}== |
=={{header|Objeck}}== |
||
< |
<syntaxhighlight lang="objeck"> |
||
??use Collection; |
|||
class Test { |
class Test { |
||
Line 7,626: | Line 8,420: | ||
} |
} |
||
} |
} |
||
</syntaxhighlight> |
|||
</lang> |
|||
Output: |
Output: |
||
Line 7,637: | Line 8,431: | ||
=={{header|OCaml}}== |
=={{header|OCaml}}== |
||
< |
<syntaxhighlight lang="ocaml">type 'a tree = Empty |
||
| Node of 'a * 'a tree * 'a tree |
| Node of 'a * 'a tree * 'a tree |
||
Line 7,686: | Line 8,480: | ||
inorder (Printf.printf "%d ") tree; print_newline (); |
inorder (Printf.printf "%d ") tree; print_newline (); |
||
postorder (Printf.printf "%d ") tree; print_newline (); |
postorder (Printf.printf "%d ") tree; print_newline (); |
||
levelorder (Printf.printf "%d ") tree; print_newline ()</ |
levelorder (Printf.printf "%d ") tree; print_newline ()</syntaxhighlight> |
||
Output: |
Output: |
||
<pre>1 2 4 7 5 3 6 8 9 |
<pre>1 2 4 7 5 3 6 8 9 |
||
Line 7,695: | Line 8,489: | ||
=={{header|Oforth}}== |
=={{header|Oforth}}== |
||
< |
<syntaxhighlight lang="oforth">Object Class new: Tree(v, l, r) |
||
Tree method: initialize(v, l, r) v := v l := l r := r ; |
Tree method: initialize(v, l, r) v := v l := l r := r ; |
||
Line 7,725: | Line 8,519: | ||
n l dup ifNotNull: [ c send ] drop |
n l dup ifNotNull: [ c send ] drop |
||
n r dup ifNotNull: [ c send ] drop |
n r dup ifNotNull: [ c send ] drop |
||
] ;</ |
] ;</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
Line 7,748: | Line 8,542: | ||
=={{header|ooRexx}}== |
=={{header|ooRexx}}== |
||
<syntaxhighlight lang="oorexx"> |
|||
<lang ooRexx> |
|||
one = .Node~new(1); |
one = .Node~new(1); |
||
two = .Node~new(2); |
two = .Node~new(2); |
||
Line 7,832: | Line 8,626: | ||
nodequeue~queue(next~right) |
nodequeue~queue(next~right) |
||
end |
end |
||
</syntaxhighlight> |
|||
</lang> |
|||
Output: |
Output: |
||
<pre> |
<pre> |
||
Line 7,842: | Line 8,636: | ||
=={{header|Oz}}== |
=={{header|Oz}}== |
||
< |
<syntaxhighlight lang="oz">declare |
||
Tree = n(1 |
Tree = n(1 |
||
n(2 |
n(2 |
||
Line 7,899: | Line 8,693: | ||
{Show {Inorder Tree}} |
{Show {Inorder Tree}} |
||
{Show {Postorder Tree}} |
{Show {Postorder Tree}} |
||
{Show {Levelorder Tree}}</ |
{Show {Levelorder Tree}}</syntaxhighlight> |
||
=={{header|PascalABC.NET}}== |
|||
<syntaxhighlight lang="delphi"> |
|||
type |
|||
Node<T> = auto class |
|||
data: T; |
|||
left,right: Node<T>; |
|||
end; |
|||
function ND<T>(data: T; left: Node<T> := nil; right: Node<T> := nil) |
|||
:= new Node<T>(data,left,right); |
|||
procedure Prefix<T>(r: Node<T>); |
|||
begin |
|||
if r = nil then |
|||
exit; |
|||
Print(r.data); |
|||
Prefix(r.left); |
|||
Prefix(r.right); |
|||
end; |
|||
procedure Infix<T>(r: Node<T>); |
|||
begin |
|||
if r = nil then |
|||
exit; |
|||
Infix(r.left); |
|||
Print(r.data); |
|||
Infix(r.right); |
|||
end; |
|||
procedure Postfix<T>(r: Node<T>); |
|||
begin |
|||
if r = nil then |
|||
exit; |
|||
Postfix(r.left); |
|||
Postfix(r.right); |
|||
Print(r.data); |
|||
end; |
|||
procedure LevelOrder<T>(r: Node<T>); |
|||
begin |
|||
if r = nil then |
|||
exit; |
|||
var q := new Queue<Node<T>>; |
|||
q.Enqueue(r); |
|||
while q.Count > 0 do |
|||
begin |
|||
var x := q.Dequeue; |
|||
Print(x.data); |
|||
if x.left <> nil then |
|||
q.Enqueue(x.Left); |
|||
if x.Right <> nil then |
|||
q.Enqueue(x.Right); |
|||
end; |
|||
end; |
|||
begin |
|||
var root := ND(1,ND(2,ND(4,ND(7)),ND(5)),ND(3,ND(6,ND(8),ND(9)))); |
|||
Println(root); |
|||
Prefix(root); Println; |
|||
Infix(root); Println; |
|||
Postfix(root); Println; |
|||
LevelOrder(root); Println; |
|||
end. |
|||
</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
(1,(2,(4,(7,nil,nil),nil),(5,nil,nil)),(3,(6,(8,nil,nil),(9,nil,nil)),nil)) |
|||
1 2 4 7 5 3 6 8 9 |
|||
7 4 2 5 1 8 6 9 3 |
|||
7 4 5 2 8 9 6 3 1 |
|||
1 2 3 4 5 6 7 8 9 |
|||
</pre> |
|||
=={{header|Perl}}== |
=={{header|Perl}}== |
||
Tree nodes are represented by 3-element arrays: [0] - the value; [1] - left child; [2] - right child. |
Tree nodes are represented by 3-element arrays: [0] - the value; [1] - left child; [2] - right child. |
||
< |
<syntaxhighlight lang="perl">sub preorder |
||
{ |
{ |
||
my $t = shift or return (); |
my $t = shift or return (); |
||
Line 7,938: | Line 8,806: | ||
print "in: @{[inorder($x)]}\n"; |
print "in: @{[inorder($x)]}\n"; |
||
print "post: @{[postorder($x)]}\n"; |
print "post: @{[postorder($x)]}\n"; |
||
print "depth: @{[depth($x)]}\n";</ |
print "depth: @{[depth($x)]}\n";</syntaxhighlight> |
||
Output: |
Output: |
||
<pre>pre: 1 2 4 7 5 3 6 8 9 |
<pre>pre: 1 2 4 7 5 3 6 8 9 |
||
Line 7,950: | Line 8,818: | ||
This is included in the distribution as demo\rosetta\Tree_traversal.exw, which also contains a way to build such a nested structure, and thirdly a "flat list of nodes" tree, that allows more interesting options such as a tag sort. |
This is included in the distribution as demo\rosetta\Tree_traversal.exw, which also contains a way to build such a nested structure, and thirdly a "flat list of nodes" tree, that allows more interesting options such as a tag sort. |
||
<!--< |
<!--<syntaxhighlight lang="phix">--> |
||
<span style="color: #008080;">constant</span> <span style="color: #000000;">VALUE</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">1</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">LEFT</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">2</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">RIGHT</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">3</span> |
<span style="color: #008080;">constant</span> <span style="color: #000000;">VALUE</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">1</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">LEFT</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">2</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">RIGHT</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">3</span> |
||
Line 7,997: | Line 8,865: | ||
<span style="color: #7060A8;">puts</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"\n postorder: "</span><span style="color: #0000FF;">)</span> <span style="color: #000000;">postorder</span><span style="color: #0000FF;">(</span><span style="color: #000000;">tree</span><span style="color: #0000FF;">)</span> |
<span style="color: #7060A8;">puts</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"\n postorder: "</span><span style="color: #0000FF;">)</span> <span style="color: #000000;">postorder</span><span style="color: #0000FF;">(</span><span style="color: #000000;">tree</span><span style="color: #0000FF;">)</span> |
||
<span style="color: #7060A8;">puts</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"\n level-order: "</span><span style="color: #0000FF;">)</span> <span style="color: #000000;">level_order</span><span style="color: #0000FF;">(</span><span style="color: #000000;">tree</span><span style="color: #0000FF;">)</span> |
<span style="color: #7060A8;">puts</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"\n level-order: "</span><span style="color: #0000FF;">)</span> <span style="color: #000000;">level_order</span><span style="color: #0000FF;">(</span><span style="color: #000000;">tree</span><span style="color: #0000FF;">)</span> |
||
<!--</ |
<!--</syntaxhighlight>--> |
||
{{out}} |
{{out}} |
||
Line 8,008: | Line 8,876: | ||
=={{header|PHP}}== |
=={{header|PHP}}== |
||
< |
<syntaxhighlight lang="php">class Node { |
||
private $left; |
private $left; |
||
private $right; |
private $right; |
||
Line 8,109: | Line 8,977: | ||
$tree->postOrder($arr[1]); |
$tree->postOrder($arr[1]); |
||
echo "\nlevel-order:\t"; |
echo "\nlevel-order:\t"; |
||
$tree->levelOrder($arr[1]);</ |
$tree->levelOrder($arr[1]);</syntaxhighlight> |
||
Output: |
Output: |
||
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
||
Line 8,117: | Line 8,985: | ||
=={{header|PicoLisp}}== |
=={{header|PicoLisp}}== |
||
< |
<syntaxhighlight lang="picolisp">(de preorder (Node Fun) |
||
(when Node |
(when Node |
||
(Fun (car Node)) |
(Fun (car Node)) |
||
Line 8,150: | Line 9,018: | ||
(prin (align -13 (pack Order ":"))) |
(prin (align -13 (pack Order ":"))) |
||
(Order *Tree printsp) |
(Order *Tree printsp) |
||
(prinl) )</ |
(prinl) )</syntaxhighlight> |
||
Output: |
Output: |
||
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
||
Line 8,159: | Line 9,027: | ||
=={{header|Prolog}}== |
=={{header|Prolog}}== |
||
Works with SWI-Prolog. |
Works with SWI-Prolog. |
||
< |
<syntaxhighlight lang="prolog">tree :- |
||
Tree= [1, |
Tree= [1, |
||
[2, |
[2, |
||
Line 8,215: | Line 9,083: | ||
append_dl(X-Y, Y-Z, X-Z). |
append_dl(X-Y, Y-Z, X-Z). |
||
</syntaxhighlight> |
|||
</lang> |
|||
Output : |
Output : |
||
<pre>?- tree. |
<pre>?- tree. |
||
Line 8,227: | Line 9,095: | ||
=={{header|PureBasic}}== |
=={{header|PureBasic}}== |
||
{{works with|PureBasic|4.5+}} |
{{works with|PureBasic|4.5+}} |
||
< |
<syntaxhighlight lang="purebasic">Structure node |
||
value.i |
value.i |
||
*left.node |
*left.node |
||
Line 8,361: | Line 9,229: | ||
Input() |
Input() |
||
CloseConsole() |
CloseConsole() |
||
EndIf</ |
EndIf</syntaxhighlight> |
||
Sample output: |
Sample output: |
||
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
||
Line 8,372: | Line 9,240: | ||
===Python: Procedural=== |
===Python: Procedural=== |
||
< |
<syntaxhighlight lang="python">from collections import namedtuple |
||
Node = namedtuple('Node', 'data, left, right') |
Node = namedtuple('Node', 'data, left, right') |
||
Line 8,443: | Line 9,311: | ||
print(f"{traversal.__name__:>{w}}:", end=' ') |
print(f"{traversal.__name__:>{w}}:", end=' ') |
||
traversal(tree) |
traversal(tree) |
||
print()</ |
print()</syntaxhighlight> |
||
'''Sample output:''' |
'''Sample output:''' |
||
Line 8,459: | Line 9,327: | ||
Subclasses a namedtuple adding traversal methods that apply a visitor function to data at nodes of the tree in order |
Subclasses a namedtuple adding traversal methods that apply a visitor function to data at nodes of the tree in order |
||
< |
<syntaxhighlight lang="python">from collections import namedtuple |
||
from sys import stdout |
from sys import stdout |
||
Line 8,519: | Line 9,387: | ||
stdout.write('\nlevelorder: ') |
stdout.write('\nlevelorder: ') |
||
tree.levelorder(printwithspace) |
tree.levelorder(printwithspace) |
||
stdout.write('\n')</ |
stdout.write('\n')</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
Line 8,536: | Line 9,404: | ||
This level of abstraction and reuse brings real efficiencies – the short and easily-written '''foldTree''', for example, doesn't just traverse and list contents in flexible orders - we can pass any kind of accumulation or tree-transformation to it. |
This level of abstraction and reuse brings real efficiencies – the short and easily-written '''foldTree''', for example, doesn't just traverse and list contents in flexible orders - we can pass any kind of accumulation or tree-transformation to it. |
||
< |
<syntaxhighlight lang="python">'''Tree traversals''' |
||
from itertools import chain |
from itertools import chain |
||
Line 8,746: | Line 9,614: | ||
if __name__ == '__main__': |
if __name__ == '__main__': |
||
main()</ |
main()</syntaxhighlight> |
||
{{Out}} |
{{Out}} |
||
<pre>Tree traversals - accumulating and folding: |
<pre>Tree traversals - accumulating and folding: |
||
Line 8,763: | Line 9,631: | ||
=={{header|Qi}}== |
=={{header|Qi}}== |
||
<syntaxhighlight lang="qi"> |
|||
<lang qi> |
|||
(set *tree* [1 [2 [4 [7]] |
(set *tree* [1 [2 [4 [7]] |
||
[5]] |
[5]] |
||
Line 8,808: | Line 9,676: | ||
(inorder (value *tree*)) |
(inorder (value *tree*)) |
||
(levelorder (value *tree*)) |
(levelorder (value *tree*)) |
||
</syntaxhighlight> |
|||
</lang> |
|||
Output: |
Output: |
||
Line 8,820: | Line 9,688: | ||
Requires the words at [[Queue/Definition#Quackery]] for <code>level-order</code>. |
Requires the words at [[Queue/Definition#Quackery]] for <code>level-order</code>. |
||
< |
<syntaxhighlight lang="quackery"> [ this ] is nil ( --> [ ) |
||
[ ' [ 1 |
[ ' [ 1 |
||
Line 8,866: | Line 9,734: | ||
tree in-order cr |
tree in-order cr |
||
tree post-order cr |
tree post-order cr |
||
tree level-order cr</ |
tree level-order cr</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
Line 8,877: | Line 9,745: | ||
=={{header|Racket}}== |
=={{header|Racket}}== |
||
< |
<syntaxhighlight lang="racket"> |
||
#lang racket |
#lang racket |
||
Line 8,900: | Line 9,768: | ||
(define (run order) |
(define (run order) |
||
(printf "~a:" (object-name order)) |
(printf "~a:" (object-name order)) |
||
(order the-tree ( |
(order the-tree (?(x) (printf " ~s" x))) |
||
(newline)) |
(newline)) |
||
(for-each run (list preorder inorder postorder levelorder)) |
(for-each run (list preorder inorder postorder levelorder)) |
||
</syntaxhighlight> |
|||
</lang> |
|||
Output: |
Output: |
||
Line 8,915: | Line 9,783: | ||
=={{header|Raku}}== |
=={{header|Raku}}== |
||
(formerly Perl 6) |
(formerly Perl 6) |
||
<lang |
<syntaxhighlight lang="raku" line>class TreeNode { |
||
has TreeNode $.parent; |
has TreeNode $.parent; |
||
has TreeNode $.left; |
has TreeNode $.left; |
||
Line 8,972: | Line 9,840: | ||
say "inorder: ",$root.in-order.join(" "); |
say "inorder: ",$root.in-order.join(" "); |
||
say "postorder: ",$root.post-order.join(" "); |
say "postorder: ",$root.post-order.join(" "); |
||
say "levelorder:",$root.level-order.join(" ");</ |
say "levelorder:",$root.level-order.join(" ");</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
||
Line 8,980: | Line 9,848: | ||
=={{header|REBOL}}== |
=={{header|REBOL}}== |
||
<syntaxhighlight lang="rebol"> |
|||
<lang REBOL> |
|||
tree: [1 [2 [4 [7 [] []] []] [5 [] []]] [3 [6 [8 [] []] [9 [] []]] []]] |
tree: [1 [2 [4 [7 [] []] []] [5 [] []]] [3 [6 [8 [] []] [9 [] []]] []]] |
||
; "compacted" version |
; "compacted" version |
||
tree: [1 [2 [4 [7 ] ] [5 ]] [3 [6 [8 ] [9 ]] ]] |
tree: [1 [2 [4 [7 ] ] [5 ]] [3 [6 [8 ] [9 ]] ]] |
||
visit: func [tree [block!]][prin rejoin [first tree " "]] |
|||
left: :second |
|||
right: :third |
|||
preorder: func [tree [block!]][ |
preorder: func [tree [block!]][ |
||
if not empty? tree [ |
if not empty? tree [visit tree] |
||
attempt [preorder |
attempt [preorder left tree] |
||
attempt [preorder |
attempt [preorder right tree] |
||
] |
] |
||
prin "preorder: " preorder tree |
prin "preorder: " preorder tree |
||
Line 8,995: | Line 9,866: | ||
inorder: func [tree [block!]][ |
inorder: func [tree [block!]][ |
||
attempt [inorder |
attempt [inorder left tree] |
||
if not empty? tree [ |
if not empty? tree [visit tree] |
||
attempt [inorder |
attempt [inorder right tree] |
||
] |
] |
||
prin "inorder: " inorder tree |
prin "inorder: " inorder tree |
||
Line 9,003: | Line 9,874: | ||
postorder: func [tree [block!]][ |
postorder: func [tree [block!]][ |
||
attempt [postorder |
attempt [postorder left tree] |
||
attempt [postorder |
attempt [postorder right tree] |
||
if not empty? tree [ |
if not empty? tree [visit tree] |
||
] |
] |
||
prin "postorder: " postorder tree |
prin "postorder: " postorder tree |
||
Line 9,018: | Line 9,889: | ||
while [not empty? queue] [ |
while [not empty? queue] [ |
||
tree: dequeue queue |
tree: dequeue queue |
||
if not empty? tree [ |
if not empty? tree [visit tree] |
||
attempt [enqueue |
attempt [enqueue left tree] |
||
attempt [enqueue |
attempt [enqueue right tree] |
||
] |
] |
||
] |
] |
||
prin "level-order: " level-order tree |
prin "level-order: " level-order tree |
||
</syntaxhighlight> |
|||
</lang> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
Line 9,032: | Line 9,903: | ||
level-order: 1 2 3 4 5 6 7 8 9 |
level-order: 1 2 3 4 5 6 7 8 9 |
||
</pre> |
</pre> |
||
=={{header|Refal}}== |
|||
<syntaxhighlight lang="refal">$ENTRY Go { |
|||
= <Show Preorder <Tree>> |
|||
<Show Inorder <Tree>> |
|||
<Show Postorder <Tree>> |
|||
<Show Levelorder <Tree>>; |
|||
}; |
|||
Show { |
|||
s.F t.T = <Prout s.F ': ' <Mu s.F t.T>>; |
|||
}; |
|||
Tree { |
|||
= (1 (2 (4 (7 () ()) ()) (5 () ())) (3 (6 (8 () ()) (9 () ())) ())); |
|||
}; |
|||
Preorder { |
|||
() = ; |
|||
(s.V t.L t.R) = s.V <Preorder t.L> <Preorder t.R>; |
|||
}; |
|||
Inorder { |
|||
() = ; |
|||
(s.V t.L t.R) = <Inorder t.L> s.V <Inorder t.R>; |
|||
}; |
|||
Postorder { |
|||
() = ; |
|||
(s.V t.L t.R) = <Postorder t.L> <Postorder t.R> s.V; |
|||
}; |
|||
Levelorder { |
|||
= ; |
|||
() e.Q = <Levelorder e.Q>; |
|||
(s.V t.L t.R) e.Q = s.V <Levelorder e.Q t.L t.R>; |
|||
};</syntaxhighlight> |
|||
{{out}} |
|||
<pre>Preorder : 1 2 4 7 5 3 6 8 9 |
|||
Inorder : 7 4 2 5 1 8 6 9 3 |
|||
Postorder : 7 4 5 2 8 9 6 3 1 |
|||
Levelorder : 1 2 3 4 5 6 7 8 9</pre> |
|||
=={{header|REXX}}== |
=={{header|REXX}}== |
||
< |
<syntaxhighlight lang="rexx"> |
||
/* REXX *************************************************************** |
/* REXX *************************************************************** |
||
* Tree traversal |
* Tree traversal |
||
Line 9,352: | Line 10,265: | ||
Say '' |
Say '' |
||
End |
End |
||
Return</ |
Return</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre> 1 |
<pre> 1 |
||
Line 9,368: | Line 10,281: | ||
=={{header|Ruby}}== |
=={{header|Ruby}}== |
||
< |
<syntaxhighlight lang="ruby">BinaryTreeNode = Struct.new(:value, :left, :right) do |
||
def self.from_array(nested_list) |
def self.from_array(nested_list) |
||
value, left, right = nested_list |
value, left, right = nested_list |
||
Line 9,407: | Line 10,320: | ||
root.send(mthd) {|node| print "#{node.value} "} |
root.send(mthd) {|node| print "#{node.value} "} |
||
puts |
puts |
||
end</ |
end</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
Line 9,418: | Line 10,331: | ||
=={{header|Rust}}== |
=={{header|Rust}}== |
||
This solution uses iteration (rather than recursion) for all traversal types. |
This solution uses iteration (rather than recursion) for all traversal types. |
||
<syntaxhighlight lang="rust"> |
|||
<lang Rust> |
|||
#![feature(box_syntax, box_patterns)] |
#![feature(box_syntax, box_patterns)] |
||
Line 9,485: | Line 10,398: | ||
} |
} |
||
// |
// From left to right |
||
fn iterative_inorder(&self) -> Vec<&TreeNode<T>> { |
fn iterative_inorder(&self) -> Vec<&TreeNode<T>> { |
||
let mut stack: Vec<&TreeNode<T>> = Vec::new(); |
let mut stack: Vec<&TreeNode<T>> = Vec::new(); |
||
let mut res: Vec<&TreeNode<T>> = Vec::new(); |
let mut res: Vec<&TreeNode<T>> = Vec::new(); |
||
let mut |
let mut opt = Some(self); |
||
while { |
|||
// Descend leftwards |
|||
while let Some(tree) = opt { |
|||
stack.push(tree); |
|||
opt = tree.left.as_deref(); |
|||
Some(box ref n) => stack.push(n), |
|||
} |
|||
stack.push(p); |
|||
match p.left { |
|||
None => break, |
|||
Some(box ref n) => p = n, |
|||
} |
|||
} |
|||
// Visit the nodes with no right child |
|||
p = stack.pop().unwrap(); |
|||
while !stack.is_empty() && p.right.is_none() { |
|||
res.push(p); |
|||
p = stack.pop().unwrap(); |
|||
} |
|||
// First node that can potentially have a right child: |
|||
res.push(p); |
|||
if stack.is_empty() { |
|||
break; |
|||
} else { |
|||
p = stack.pop().unwrap(); |
|||
} |
} |
||
!stack.is_empty() |
|||
} { |
|||
let tree = stack.pop().unwrap(); |
|||
res.push(tree); |
|||
opt = tree.right.as_deref(); |
|||
} |
} |
||
res |
res |
||
Line 9,594: | Line 10,492: | ||
} |
} |
||
} |
} |
||
</syntaxhighlight> |
|||
</lang> |
|||
Output is same as Ruby et al. |
Output is same as Ruby et al. |
||
=={{header|Scala}}== |
=={{header|Scala}}== |
||
{{works with|Scala|2.11.x}} |
{{works with|Scala|2.11.x}} |
||
< |
<syntaxhighlight lang="scala">case class IntNode(value: Int, left: Option[IntNode] = None, right: Option[IntNode] = None) { |
||
def preorder(f: IntNode => Unit) { |
def preorder(f: IntNode => Unit) { |
||
Line 9,653: | Line 10,551: | ||
println(s) |
println(s) |
||
} |
} |
||
}</ |
}</syntaxhighlight> |
||
Output:<pre> |
Output:<pre> |
||
Line 9,663: | Line 10,561: | ||
=={{header|Scheme}}== |
=={{header|Scheme}}== |
||
< |
<syntaxhighlight lang="scheme">(define (preorder tree) |
||
(if (null? tree) |
(if (null? tree) |
||
'() |
'() |
||
Line 9,728: | Line 10,626: | ||
()))) |
()))) |
||
(demonstration the-task-tree)</ |
(demonstration the-task-tree)</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
||
Line 9,736: | Line 10,634: | ||
=={{header|SequenceL}}== |
=={{header|SequenceL}}== |
||
<syntaxhighlight lang="sequencel"> |
|||
<lang sequenceL> |
|||
main(args(2)) := |
main(args(2)) := |
||
"preorder: " ++ toString(preOrder(testTree)) ++ |
"preorder: " ++ toString(preOrder(testTree)) ++ |
||
Line 9,779: | Line 10,677: | ||
) |
) |
||
); |
); |
||
</syntaxhighlight> |
|||
</lang> |
|||
{{out}} |
{{out}} |
||
Output: |
Output: |
||
Line 9,788: | Line 10,686: | ||
level-order: [1,2,3,4,5,6,7,8,9] |
level-order: [1,2,3,4,5,6,7,8,9] |
||
</pre> |
</pre> |
||
=={{header|SETL}}== |
|||
<syntaxhighlight lang="setl">program tree_traversal; |
|||
tree := [1, [2, [4, [7]], [5]], [3, [6, [8], [9]]]]; |
|||
print("preorder ", preorder(tree)); |
|||
print("inorder ", inorder(tree)); |
|||
print("postorder ", postorder(tree)); |
|||
print("level-order ", levelorder(tree)); |
|||
proc preorder(tree); |
|||
if tree = om then return []; end if; |
|||
[item, left, right] := tree; |
|||
return [item] + preorder(left) + preorder(right); |
|||
end proc; |
|||
proc inorder(tree); |
|||
if tree = om then return []; end if; |
|||
[item, left, right] := tree; |
|||
return inorder(left) + [item] + inorder(right); |
|||
end proc; |
|||
proc postorder(tree); |
|||
if tree = om then return []; end if; |
|||
[item, left, right] := tree; |
|||
return postorder(left) + postorder(right) + [item]; |
|||
end proc; |
|||
proc levelorder(tree); |
|||
items := []; |
|||
loop init queue := [tree]; while queue /= [] do |
|||
[item, left, right] fromb queue; |
|||
items with:= item; |
|||
if left /= om then queue with:= left; end if; |
|||
if right /= om then queue with:= right; end if; |
|||
end loop; |
|||
return items; |
|||
end proc; |
|||
end program;</syntaxhighlight> |
|||
{{out}} |
|||
<pre>preorder [1 2 4 7 5 3 6 8 9] |
|||
inorder [7 4 2 5 1 8 6 9 3] |
|||
postorder [7 4 5 2 8 9 6 3 1] |
|||
level-order [1 2 3 4 5 6 7 8 9]</pre> |
|||
=={{header|Sidef}}== |
=={{header|Sidef}}== |
||
{{trans|Perl}} |
{{trans|Perl}} |
||
< |
<syntaxhighlight lang="ruby">func preorder(t) { |
||
t ? [t[0], __FUNC__(t[1])..., __FUNC__(t[2])...] : []; |
t ? [t[0], __FUNC__(t[1])..., __FUNC__(t[2])...] : []; |
||
} |
} |
||
Line 9,818: | Line 10,760: | ||
say "in: #{inorder(x)}"; |
say "in: #{inorder(x)}"; |
||
say "post: #{postorder(x)}"; |
say "post: #{postorder(x)}"; |
||
say "depth: #{depth(x)}";</ |
say "depth: #{depth(x)}";</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
Line 9,837: | Line 10,779: | ||
'''Object subclass: EmptyNode''' |
'''Object subclass: EmptyNode''' |
||
< |
<syntaxhighlight lang="smalltalk">"Protocol: visiting" |
||
EmptyNode>>accept: aVisitor |
EmptyNode>>accept: aVisitor |
||
Line 9,846: | Line 10,788: | ||
EmptyNode>>traverse: aVisitorClass do: aBlock |
EmptyNode>>traverse: aVisitorClass do: aBlock |
||
^self accept: (aVisitorClass block: aBlock) |
^self accept: (aVisitorClass block: aBlock) |
||
</syntaxhighlight> |
|||
</lang> |
|||
'''EmptyNode subclass: Node''' |
'''EmptyNode subclass: Node''' |
||
< |
<syntaxhighlight lang="smalltalk">"Protocol: visiting" |
||
Node>>accept: aVisitor |
Node>>accept: aVisitor |
||
^aVisitor visit: self |
^aVisitor visit: self |
||
Line 9,884: | Line 10,826: | ||
Node class>>data: anObject |
Node class>>data: anObject |
||
^self new data: anObject |
^self new data: anObject |
||
</syntaxhighlight> |
|||
</lang> |
|||
'''Object subclass: Visitor''' |
'''Object subclass: Visitor''' |
||
< |
<syntaxhighlight lang="smalltalk">"Protocol: visiting" |
||
visit: aNode |
visit: aNode |
||
self subclassResponsibility |
self subclassResponsibility |
||
Line 9,904: | Line 10,846: | ||
Visitor class>>block: aBlock |
Visitor class>>block: aBlock |
||
^self new block: aBlock |
^self new block: aBlock |
||
</syntaxhighlight> |
|||
</lang> |
|||
'''Visitor subclass: InOrder''' |
'''Visitor subclass: InOrder''' |
||
< |
<syntaxhighlight lang="smalltalk">"Protocol: visiting" |
||
InOrder>>visit: aNode |
InOrder>>visit: aNode |
||
aNode left accept: self. |
aNode left accept: self. |
||
block value: aNode. |
block value: aNode. |
||
aNode right accept: self |
aNode right accept: self |
||
</syntaxhighlight> |
|||
</lang> |
|||
'''Visitor subclass: LevelOrder''' |
'''Visitor subclass: LevelOrder''' |
||
< |
<syntaxhighlight lang="smalltalk">"Protocol: visiting" |
||
LevelOrder>>visit: aNode |
LevelOrder>>visit: aNode |
||
| queue | |
| queue | |
||
Line 9,927: | Line 10,869: | ||
add: aNode right; |
add: aNode right; |
||
yourself |
yourself |
||
</syntaxhighlight> |
|||
</lang> |
|||
'''Visitor subclass: PostOrder''' |
'''Visitor subclass: PostOrder''' |
||
< |
<syntaxhighlight lang="smalltalk">"Protocol: visiting" |
||
PostOrder>>visit: aNode |
PostOrder>>visit: aNode |
||
aNode left accept: self. |
aNode left accept: self. |
||
aNode right accept: self. |
aNode right accept: self. |
||
block value: aNode |
block value: aNode |
||
</syntaxhighlight> |
|||
</lang> |
|||
"Visitor subclass: PreOrder" |
"Visitor subclass: PreOrder" |
||
< |
<syntaxhighlight lang="smalltalk">"Protocol: visiting" |
||
PreOrder>>visit: aNode |
PreOrder>>visit: aNode |
||
block value: aNode. |
block value: aNode. |
||
aNode left accept: self. |
aNode left accept: self. |
||
aNode right accept: self |
aNode right accept: self |
||
</syntaxhighlight> |
|||
</lang> |
|||
Execute code in a Workspace: |
Execute code in a Workspace: |
||
< |
<syntaxhighlight lang="smalltalk">| tree | |
||
tree := (Node data: 1) |
tree := (Node data: 1) |
||
left: ((Node data: 2) |
left: ((Node data: 2) |
||
Line 9,964: | Line 10,906: | ||
tree traverse: LevelOrder do: [:node | Transcript print: node data; space]. |
tree traverse: LevelOrder do: [:node | Transcript print: node data; space]. |
||
Transcript cr. |
Transcript cr. |
||
</syntaxhighlight> |
|||
</lang> |
|||
Output in Transcript: |
Output in Transcript: |
||
Line 9,973: | Line 10,915: | ||
=={{header|Swift}}== |
=={{header|Swift}}== |
||
< |
<syntaxhighlight lang="swift">class TreeNode<T> { |
||
let value: T |
let value: T |
||
let left: TreeNode? |
let left: TreeNode? |
||
Line 10,058: | Line 11,000: | ||
print("level-order: ", terminator: "") |
print("level-order: ", terminator: "") |
||
n.levelOrder(function: fn) |
n.levelOrder(function: fn) |
||
print()</ |
print()</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
Line 10,070: | Line 11,012: | ||
=={{header|Tcl}}== |
=={{header|Tcl}}== |
||
{{works with|Tcl|8.6}} or {{libheader|TclOO}} |
{{works with|Tcl|8.6}} or {{libheader|TclOO}} |
||
< |
<syntaxhighlight lang="tcl">oo::class create tree { |
||
# Basic tree data structure stuff... |
# Basic tree data structure stuff... |
||
variable val l r |
variable val l r |
||
Line 10,119: | Line 11,061: | ||
} |
} |
||
} |
} |
||
}</ |
}</syntaxhighlight> |
||
Note that in Tcl it is conventional to handle performing something “for each element” by evaluating a script in the caller's scope for each node after setting a caller-nominated variable to the value for that iteration. Doing this transparently while recursing requires the use of a varying ‘level’ parameter to <code>upvar</code> and <code>uplevel</code>, but makes for compact and clear code. |
Note that in Tcl it is conventional to handle performing something “for each element” by evaluating a script in the caller's scope for each node after setting a caller-nominated variable to the value for that iteration. Doing this transparently while recursing requires the use of a varying ‘level’ parameter to <code>upvar</code> and <code>uplevel</code>, but makes for compact and clear code. |
||
Demo code to satisfy the official challenge instance: |
Demo code to satisfy the official challenge instance: |
||
< |
<syntaxhighlight lang="tcl"># Helpers to make construction and listing of a whole tree simpler |
||
proc Tree nested { |
proc Tree nested { |
||
lassign $nested v l r |
lassign $nested v l r |
||
Line 10,144: | Line 11,086: | ||
puts "postorder: [Listify $t postorder]" |
puts "postorder: [Listify $t postorder]" |
||
puts "level-order: [Listify $t levelorder]" |
puts "level-order: [Listify $t levelorder]" |
||
$t destroy</ |
$t destroy</syntaxhighlight> |
||
Output: |
Output: |
||
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
<pre>preorder: 1 2 4 7 5 3 6 8 9 |
||
Line 10,153: | Line 11,095: | ||
=={{header|UNIX Shell}}== |
=={{header|UNIX Shell}}== |
||
Bash (also "sh" on most Unix systems) has arrays. We implement a node as an association between three arrays: left, right, and value. |
Bash (also "sh" on most Unix systems) has arrays. We implement a node as an association between three arrays: left, right, and value. |
||
< |
<syntaxhighlight lang="bash">left=() |
||
right=() |
right=() |
||
value=() |
value=() |
||
Line 10,236: | Line 11,178: | ||
inorder 1 |
inorder 1 |
||
postorder 1 |
postorder 1 |
||
levelorder 1</ |
levelorder 1</syntaxhighlight> |
||
The output: |
The output: |
||
< |
<syntaxhighlight lang="bash">preorder: 1 2 4 7 5 3 6 8 9 |
||
inorder: 7 4 2 5 1 8 6 9 3 |
inorder: 7 4 2 5 1 8 6 9 3 |
||
postorder: 7 4 5 2 8 9 6 3 1 |
postorder: 7 4 5 2 8 9 6 3 1 |
||
level-order: 1 2 3 4 5 6 7 8 9</ |
level-order: 1 2 3 4 5 6 7 8 9</syntaxhighlight> |
||
=={{header|Ursala}}== |
=={{header|Ursala}}== |
||
Line 10,253: | Line 11,195: | ||
the result on standard output as a |
the result on standard output as a |
||
list of lists of naturals. |
list of lists of naturals. |
||
< |
<syntaxhighlight lang="ursala">tree = |
||
1^:< |
1^:< |
||
Line 10,266: | Line 11,208: | ||
#cast %nLL |
#cast %nLL |
||
main = <.pre,in,post,lev> tree</ |
main = <.pre,in,post,lev> tree</syntaxhighlight> |
||
output: |
output: |
||
<pre> |
<pre> |
||
Line 10,278: | Line 11,220: | ||
=={{header|VBA}}== |
=={{header|VBA}}== |
||
TreeItem Class Module |
TreeItem Class Module |
||
<syntaxhighlight lang="vb"> |
|||
<lang VB> |
|||
Public Value As Integer |
Public Value As Integer |
||
Public LeftChild As TreeItem |
Public LeftChild As TreeItem |
||
Public RightChild As TreeItem |
Public RightChild As TreeItem |
||
</syntaxhighlight> |
|||
</lang> |
|||
Module |
Module |
||
<syntaxhighlight lang="vb"> |
|||
<lang VB> |
|||
Dim tihead As TreeItem |
Dim tihead As TreeItem |
||
Line 10,356: | Line 11,298: | ||
Call LevelOrder(tihead) |
Call LevelOrder(tihead) |
||
End Sub |
End Sub |
||
</syntaxhighlight> |
|||
</lang> |
|||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
Line 10,364: | Line 11,306: | ||
level-order: 1 2 3 4 5 6 7 8 9 |
level-order: 1 2 3 4 5 6 7 8 9 |
||
</pre> |
</pre> |
||
=={{header|VBScript}}== |
|||
<syntaxhighlight lang="vb"> |
|||
' 1 |
|||
' / \ |
|||
' / \ |
|||
' / \ |
|||
' 2 3 |
|||
' / \ / |
|||
' 4 5 6 |
|||
' / / \ |
|||
' 7 8 9 |
|||
'with no pointers available, the binary tree has to be saved in an array |
|||
' root at index 1 |
|||
' parent index is i\2 |
|||
' children indexes are i*2 and i*2+1 |
|||
' a value of 0 denotes an empty branch |
|||
Sub print(s): |
|||
On Error Resume Next |
|||
WScript.stdout.Write(s) |
|||
If err= &h80070006& Then WScript.Echo " Please run this script with CScript": WScript.quit |
|||
End Sub |
|||
Sub inorder(i) |
|||
If tree(i*2)<>0 Then inorder(i*2) |
|||
print tree(i)& vbtab |
|||
If tree(i*2+1)<>0 Then inorder(i*2+1) |
|||
End Sub |
|||
Sub preorder(i) |
|||
print tree(i)& vbtab |
|||
If tree(i*2)<>0 Then preorder(i*2) |
|||
If tree(i*2+1)<>0 Then preorder(i*2+1) |
|||
End Sub |
|||
Sub postorder(i) |
|||
If tree(i*2)<>0 Then postorder(i*2) |
|||
If tree(i*2+1)<>0 Then postorder(i*2+1) |
|||
print tree(i)& vbTab |
|||
End Sub |
|||
Sub levelorder(x) |
|||
Dim i |
|||
For i= 1 To UBound(tree) |
|||
If tree(i)<>0 Then print tree(i)& vbTab |
|||
Next |
|||
End sub |
|||
Dim tree |
|||
' 1 2 3 4 5 6 7 8 9 1011121314151617181920212223242526 |
|||
' 1 2 2 3 3 3 3 4 4 4 4 4 4 4 4 |
|||
tree=Array(0,1,2,3,4,5,6,0,7,0,0,0,8,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0) |
|||
print vbCrLf & "Preorder" & vbcrlf |
|||
preorder(1) |
|||
print vbCrLf & "Inorder" & vbcrlf |
|||
inorder(1) |
|||
print vbCrLf & "Postorder" & vbcrlf |
|||
postorder(1) |
|||
print vbCrLf & "Levelorder" & vbcrlf |
|||
levelorder(1) |
|||
</syntaxhighlight> |
|||
{{out}} |
|||
<small> |
|||
<pre> |
|||
Preorder |
|||
1 2 4 7 5 3 6 8 9 |
|||
Inorder |
|||
7 4 2 5 1 8 6 9 3 |
|||
Postorder |
|||
7 4 5 2 8 9 6 3 1 |
|||
Levelorder |
|||
1 2 3 4 5 6 7 8 9 |
|||
</pre> |
|||
</small> |
|||
=={{header|Wren}}== |
=={{header|Wren}}== |
||
{{trans|Kotlin}} |
{{trans|Kotlin}} |
||
The object-oriented version. |
The object-oriented version. |
||
< |
<syntaxhighlight lang="wren">class Node { |
||
construct new(v) { |
construct new(v) { |
||
_v = v |
_v = v |
||
Line 10,434: | Line 11,453: | ||
nodes[1].exec(" inOrder:", Fn.new { |n| n.inOrder() }) |
nodes[1].exec(" inOrder:", Fn.new { |n| n.inOrder() }) |
||
nodes[1].exec(" postOrder:", Fn.new { |n| n.postOrder() }) |
nodes[1].exec(" postOrder:", Fn.new { |n| n.postOrder() }) |
||
nodes[1].exec("level-order:", Fn.new { |n| n.levelOrder() })</ |
nodes[1].exec("level-order:", Fn.new { |n| n.levelOrder() })</syntaxhighlight> |
||
{{out}} |
{{out}} |
||
Line 10,442: | Line 11,461: | ||
postOrder: 7 4 5 2 8 9 6 3 1 |
postOrder: 7 4 5 2 8 9 6 3 1 |
||
level-order: 1 2 3 4 5 6 7 8 9 |
level-order: 1 2 3 4 5 6 7 8 9 |
||
</pre> |
|||
=={{header|XPL0}}== |
|||
<syntaxhighlight lang "XPL0">def \Node\ Left, Data, Right; |
|||
proc PreOrder(Node); \Traverse tree at Node in preorder |
|||
int Node; |
|||
[if Node # 0 then |
|||
[IntOut(0, Node(Data)); ChOut(0, ^ ); |
|||
PreOrder(Node(Left)); |
|||
PreOrder(Node(Right)); |
|||
]; |
|||
]; |
|||
proc InOrder(Node); \Traverse tree at Node in inorder |
|||
int Node; |
|||
[if Node # 0 then |
|||
[InOrder(Node(Left)); |
|||
IntOut(0, Node(Data)); ChOut(0, ^ ); |
|||
InOrder(Node(Right)); |
|||
]; |
|||
]; |
|||
proc PostOrder(Node); \Traverse tree at Node in postorder |
|||
int Node; |
|||
[if Node # 0 then |
|||
[PostOrder(Node(Left)); |
|||
PostOrder(Node(Right)); |
|||
IntOut(0, Node(Data)); ChOut(0, ^ ); |
|||
]; |
|||
]; |
|||
proc LevelOrder(Node); \Traverse tree at Node in level-order |
|||
int Node; |
|||
def S=100*3; \size of queue (must be a multiple of 3 for wrap-around) |
|||
int Q(S), \queue (FIFO) |
|||
F, E; \fill and empty indexes |
|||
proc EnQ(Node); \Enqueue Node |
|||
int Node; |
|||
[Q(F):= Node(Left); F:= F+1; |
|||
Q(F):= Node(Data); F:= F+1; |
|||
Q(F):= Node(Right); F:= F+1; |
|||
if F >= S then F:= 0; |
|||
]; |
|||
proc DeQ; \Dequeue Node |
|||
[Node(Left):= Q(E); E:= E+1; |
|||
Node(Data):= Q(E); E:= E+1; |
|||
Node(Right):= Q(E); E:= E+1; |
|||
if E >= S then E:= 0; |
|||
]; |
|||
[F:= 0; E:= 0; \empty queue |
|||
EnQ(Node); |
|||
while E # F do |
|||
[DeQ; |
|||
IntOut(0, Node(Data)); ChOut(0, ^ ); |
|||
if Node(Left) # 0 then |
|||
EnQ(Node(Left)); |
|||
if Node(Right) # 0 then |
|||
EnQ(Node(Right)); |
|||
]; |
|||
]; |
|||
int Tree; |
|||
[Tree:= [[ [[0,7,0],4,0], 2, [0,5,0]], 1, [ [[0,8,0], 6, [0,9,0]], 3, 0 ]]; |
|||
Text(0, "preorder: "); PreOrder(Tree); CrLf(0); |
|||
Text(0, "inorder: "); InOrder(Tree); CrLf(0); |
|||
Text(0, "postorder: "); PostOrder(Tree); CrLf(0); |
|||
Text(0, "level-order: "); LevelOrder(Tree); CrLf(0); |
|||
]</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
preorder: 1 2 4 7 5 3 6 8 9 |
|||
inorder: 7 4 2 5 1 8 6 9 3 |
|||
postorder: 7 4 5 2 8 9 6 3 1 |
|||
level-order: 1 2 3 4 5 6 7 8 9 |
|||
</pre> |
</pre> |
||
=={{header|zkl}}== |
=={{header|zkl}}== |
||
< |
<syntaxhighlight lang="zkl">class Node{ var [mixin=Node]left,right; var v; |
||
fcn init(val,[Node]l=Void,[Node]r=Void) { v,left,right=vm.arglist } |
fcn init(val,[Node]l=Void,[Node]r=Void) { v,left,right=vm.arglist } |
||
} |
} |
||
Line 10,475: | Line 11,572: | ||
sink |
sink |
||
} |
} |
||
}</ |
}</syntaxhighlight> |
||
It is easy to convert to lazy by replacing "sink.write" with "vm.yield" and wrapping the traversal with a Utils.Generator. |
It is easy to convert to lazy by replacing "sink.write" with "vm.yield" and wrapping the traversal with a Utils.Generator. |
||
< |
<syntaxhighlight lang="zkl">t:=BTree(Node(1, |
||
Node(2, |
Node(2, |
||
Node(4,Node(7)), |
Node(4,Node(7)), |
||
Line 10,487: | Line 11,584: | ||
t.inOrder() .apply("v").println(" inorder"); |
t.inOrder() .apply("v").println(" inorder"); |
||
t.postOrder() .apply("v").println(" postorder"); |
t.postOrder() .apply("v").println(" postorder"); |
||
t.levelOrder().apply("v").println(" level-order");</ |
t.levelOrder().apply("v").println(" level-order");</syntaxhighlight> |
||
The "apply("v")" extracts the contents of var v from each node. |
The "apply("v")" extracts the contents of var v from each node. |
||
{{out}} |
{{out}} |
Latest revision as of 07:35, 5 July 2024
![Task](http://static.miraheze.org/rosettacodewiki/thumb/b/ba/Rcode-button-task-crushed.png/64px-Rcode-button-task-crushed.png)
You are encouraged to solve this task according to the task description, using any language you may know.
- Task
Implement a binary tree where each node carries an integer, and implement:
- pre-order,
- in-order,
- post-order, and
- level-order traversal.
Use those traversals to output the following tree:
1 / \ / \ / \ 2 3 / \ / 4 5 6 / / \ 7 8 9
The correct output should look like this:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
- See also
- Wikipedia article: Tree traversal.
11l
T Node
Int data
Node? left
Node? right
F (data, Node? left = N, Node? right = N)
.data = data
.left = left
.right = right
F preorder(visitor) -> Void
visitor(.data)
I .left != N
.left.preorder(visitor)
I .right != N
.right.preorder(visitor)
F inorder(visitor) -> Void
I .left != N
.left.inorder(visitor)
visitor(.data)
I .right != N
.right.inorder(visitor)
F postorder(visitor) -> Void
I .left != N
.left.postorder(visitor)
I .right != N
.right.postorder(visitor)
visitor(.data)
F preorder2(&d, level = 0) -> Void
d[level].append(.data)
I .left != N
.left.preorder2(d, level + 1)
I .right != N
.right.preorder2(d, level + 1)
F levelorder(visitor)
DefaultDict[Int, [Int]] d
.preorder2(&d)
L(k) sorted(d.keys())
L(v) d[k]
visitor(v)
V tree = Node(1,
Node(2,
Node(4,
Node(7, N, N),
N),
Node(5, N, N)),
Node(3,
Node(6,
Node(8, N, N),
Node(9, N, N)),
N))
F printwithspace(Int i)
print(‘#. ’.format(i), end' ‘’)
print(‘ preorder: ’, end' ‘’)
tree.preorder(printwithspace)
print()
print(‘ inorder: ’, end' ‘’)
tree.inorder(printwithspace)
print()
print(‘ postorder: ’, end' ‘’)
tree.postorder(printwithspace)
print()
print(‘levelorder: ’, end' ‘’)
tree.levelorder(printwithspace)
print()
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 levelorder: 1 2 3 4 5 6 7 8 9
8080 Assembly
org 100h
jmp demo
;;; Traverse tree at DE according to method at BC.
;;; Call routine at HL with DE=<value> for each value encounterd.
travrs: shld trvcb+1 ; Store routine pointer
xchg ; Tree in HL
push b ; Jump to method BC
ret
;;; Preorder traversal
preo: mov a,h
ora l
rz ; Null node = stop
mov e,m
inx h
mov d,m ; Load value
inx h
push h ; Handle value
call trvcb
pop h ; Left node
mov e,m
inx h
mov d,m
inx h
push h ; Save pointer
xchg
call preo
pop h
mov e,m
inx h ; Right node
mov d,m
xchg
jmp preo
;;; Inorder traversal
ino: mov a,h
ora l
rz ; Null node = stop
mov e,m
inx h
mov d,m ; Load value
inx h
push d ; Save value on stack
mov e,m
inx h
mov d,m
inx h ; Load left node
push h ; Save pointer on stack
xchg
call ino ; Traverse left node
pop h
pop d ; Get value
push h
call trvcb ; Handle value
pop h
mov e,m
inx h
mov d,m
xchg
jmp ino ; Traverse right node
;;; Postorder traversal
posto: mov a,h
ora l
rz ; Null node = stop
mov e,m
inx h
mov d,m ; Load value
inx h
push d ; Keep value on stack
mov e,m
inx h
mov d,m
inx h ; Load left node
push h
xchg
call posto ; Traverse left node
pop h
mov e,m
inx h
mov d,m ; Load right node
xchg
call posto ; Traverse right node
pop d ; Get value from stack
jmp trvcb ; Handle value
;;; Level-order traversal
lvlo: shld queue ; Store current node at beginning of queue
lxi h,queue ; HL = Queue start pointer
lxi b,queue+2 ; BC = Queue end pointer
lvllp: mov a,h ; When start == end, stop
cmp b
jnz lvlt ; Not equal
mov a,l
cmp c
rz ; Equal = stop
lvlt: mov e,m ; Load current node in DE
inx h
mov d,m
inx h
mov a,d ; Null node = ignore
ora e
jz lvllp
push h ; Keep queue start pointer
xchg ; HL = current node
mov e,m ; Load value into DE
inx h
mov d,m
inx h
push h ; Keep pointer to left and right nodes
push b ; And pointer to end of queue
call trvcb ; Handle value
pop b ; Restore pointer to end of queue
pop h ; Restore pointer to left and right nodes
mvi d,4 ; D = copy counter
lvlcp: mov a,m ; Copy left and right nodes to queue
stax b
inx h
inx b
dcr d
jnz lvlcp
pop h ; Restore queue stack pointer
jmp lvllp
trvcb: jmp 0 ; Callback pointer
;;; Run examples
demo: lhld 6 ; Move stack to top of memory
sphl
lxi h,0 ; So we can still RET out of the program
push h
lxi h,orders
order: mov e,m ; Get string
inx h
mov d,m
inx h
mov a,e ; 0 = done
ora d
rz
push h ; Print string
call print
pop h
mov c,m ; Load method in BC
inx h
mov b,m
inx h
push h
lxi d,tree ; Tree in DE
lxi h,cb ; Callback in HL
call travrs ; Traverse the tree
lxi d,nl
call print ; Newline
pop h ; Restore table pointer
jmp order
;;; Print the tree value. They're all <10 for the example, so we
;;; don't need multiple digits.
cb: mvi a,'0'
add e
sta nstr
lxi d,nstr
print: mvi c,9 ; CP/M print string call
jmp 5
nstr: db '* $'
nl: db 13,10,'$'
;;; Example tree
tree: dw 1, node2, node3
node2: dw 2, node4, node5
node3: dw 3, node6, 0
node4: dw 4, node7, 0
node5: dw 5, 0, 0
node6: dw 6, node8, node9
node7: dw 7, 0, 0
node8: dw 8, 0, 0
node9: dw 9, 0 ,0
;;; Table of names and orders
orders: dw spreo,preo
dw sino,ino
dw sposto,posto
dw slvlo,lvlo
dw 0
spreo: db 'Preorder: $'
sino: db 'Inorder: $'
sposto: db 'Postorder: $'
slvlo: db 'Level-order: $'
queue: equ $ ; Put level-order queue on heap
- Output:
Preorder: 1 2 4 7 5 3 6 8 9 Inorder: 7 4 2 5 1 8 6 9 3 Postorder: 7 4 5 2 8 9 6 3 1 Level-order: 1 2 3 4 5 6 7 8 9
8086 Assembly
cpu 8086
org 100h
section .text
jmp demo
;;; Traverse tree at SI. Call routine at CX with values in AX.
;;; CX must preserve BX, CX, SI, DI.
;;; Preorder traversal
preo: test si,si
jz pdone ; Zero pointer = done
lodsw ; Load value
call cx ; Handle value
push si ; Keep value
mov si,[si] ; Load left node
call preo ; Traverse left node
pop si
mov si,[si+2] ; Load right node
jmp preo ; Traverse right node
;;; Inorder traversal
ino: test si,si
jz pdone ; Zero pointer = done
push si
mov si,[si+2] ; Load left node
call ino ; Traverse left node
pop si
lodsw ; Load value
call cx ; Handle value
mov si,[si+2] ; Load right node
jmp ino ; Traverse right node
;;; Postorder traversal
posto: test si,si
jz pdone ; Zero pointer = done
push si
mov si,[si+2] ; Load left node
call posto ; Traverse left node
pop si
push si
mov si,[si+4] ; Load right node
call posto
pop si ; Load value
lodsw
jmp cx ; Handle value
pdone: ret
;;; Level-order traversal
lvlo: mov di,queue ; DI = queue end pointer
mov ax,si
mov si,di ; SI = queue start pointer
stosw
.step: cmp di,si ; If end == start, done
je pdone
lodsw ; Get next item
test ax,ax ; Null?
jz .step
mov bx,si ; Keep start pointer in BX
mov si,ax ; Load item
lodsw ; Get value
call cx ; Handle value
lodsw ; Copy nodes to queue
stosw
lodsw
stosw
mov si,bx ; Put start pointer back
jmp .step
;;; Demo code
demo: mov si,orders
.loop: lodsw ; Load next order
test ax,ax
jz .done
mov dx,ax ; Print order name
mov ah,9
int 21h
lodsw ; Load order routine
mov bp,si ; Keep SI
mov si,tree ; Traverse the tree
mov cx,pdgt ; Printing the digits
call ax
mov si,bp
jmp .loop
.done: ret
;;; Callback: print single digit
pdgt: add al,'0'
mov [.str],al
mov ah,9
mov dx,.str
int 21h
ret
.str: db '* $'
section .data
;;; List of orders
orders: dw .preo,preo
dw .ino,ino
dw .posto,posto
dw .lvlo,lvlo
dw 0
.preo: db 'Preorder: $'
.ino: db 13,10,'Inorder: $'
.posto: db 13,10,'Postorder: $'
.lvlo: db 13,10,'Level-order: $'
;;; Exampe tree
tree: dw 1,.n2,.n3
.n2: dw 2,.n4,.n5
.n3: dw 3,.n6,0
.n4: dw 4,.n7,0
.n5: dw 5,0,0
.n6: dw 6,.n8,.n9
.n7: dw 7,0,0
.n8: dw 8,0,0
.n9: dw 9,0,0
section .bss
queue: resw 256
- Output:
Preorder: 1 2 4 7 5 3 6 8 9 Inorder: 7 4 2 5 1 8 6 9 3 Postorder: 7 4 5 2 8 9 6 3 1 Level-order: 1 2 3 4 5 6 7 8 9
AArch64 Assembly
/* ARM assembly AARCH64 Raspberry PI 3B */
/* program deftree64.s */
/*******************************************/
/* Constantes file */
/*******************************************/
/* for this file see task include a file in language AArch64 assembly*/
.include "../includeConstantesARM64.inc"
.equ NBVAL, 9
/*******************************************/
/* Structures */
/********************************************/
/* structure tree */
.struct 0
tree_root: // root pointer
.struct tree_root + 8
tree_size: // number of element of tree
.struct tree_size + 8
tree_fin:
/* structure node tree */
.struct 0
node_left: // left pointer
.struct node_left + 8
node_right: // right pointer
.struct node_right + 8
node_value: // element value
.struct node_value + 8
node_fin:
/* structure queue*/
.struct 0
queue_begin: // next pointer
.struct queue_begin + 8
queue_end: // element value
.struct queue_end + 8
queue_fin:
/* structure node queue */
.struct 0
queue_node_next: // next pointer
.struct queue_node_next + 8
queue_node_value: // element value
.struct queue_node_value + 8
queue_node_fin:
/*******************************************/
/* Initialized data */
/*******************************************/
.data
szMessInOrder: .asciz "inOrder :\n"
szMessPreOrder: .asciz "PreOrder :\n"
szMessPostOrder: .asciz "PostOrder :\n"
szMessLevelOrder: .asciz "LevelOrder :\n"
szCarriageReturn: .asciz "\n"
/* datas error display */
szMessErreur: .asciz "Error detected.\n"
/* datas message display */
szMessResult: .ascii "Element value : @ \n"
/*******************************************/
/* UnInitialized data */
/*******************************************/
.bss
.align 4
sZoneConv: .skip 24
stTree: .skip tree_fin // place to structure tree
stQueue: .skip queue_fin // place to structure queue
/*******************************************/
/* code section */
/*******************************************/
.text
.global main
main:
mov x1,1 // node tree value
1:
ldr x0,qAdrstTree // structure tree address
bl insertElement // add element value x1
cmp x0,-1
beq 99f
add x1,x1,1 // increment value
cmp x1,NBVAL // end ?
ble 1b // no -> loop
ldr x0,qAdrszMessPreOrder
bl affichageMess
ldr x3,qAdrstTree // tree root address (begin structure)
ldr x0,[x3,#tree_root]
ldr x1,qAdrdisplayElement // function to execute
bl preOrder
ldr x0,qAdrszMessInOrder
bl affichageMess
ldr x3,qAdrstTree
ldr x0,[x3,#tree_root]
ldr x1,qAdrdisplayElement // function to execute
bl inOrder
ldr x0,qAdrszMessPostOrder
bl affichageMess
ldr x3,qAdrstTree
ldr x0,[x3,#tree_root]
ldr x1,qAdrdisplayElement // function to execute
bl postOrder
ldr x0,qAdrszMessLevelOrder
bl affichageMess
ldr x3,qAdrstTree
ldr x0,[x3,#tree_root]
ldr x1,qAdrdisplayElement // function to execute
bl levelOrder
b 100f
99: // display error
ldr x0,qAdrszMessErreur
bl affichageMess
100: // standard end of the program
mov x8,EXIT // request to exit program
svc 0 // perform system call
qAdrszMessInOrder: .quad szMessInOrder
qAdrszMessPreOrder: .quad szMessPreOrder
qAdrszMessPostOrder: .quad szMessPostOrder
qAdrszMessLevelOrder: .quad szMessLevelOrder
qAdrszMessErreur: .quad szMessErreur
qAdrszCarriageReturn: .quad szCarriageReturn
qAdrstTree: .quad stTree
qAdrstQueue: .quad stQueue
qAdrdisplayElement: .quad displayElement
/******************************************************************/
/* insert element in the tree */
/******************************************************************/
/* x0 contains the address of the tree structure */
/* x1 contains the value of element */
/* x0 returns address of element or - 1 if error */
insertElement:
stp x1,lr,[sp,-16]! // save registers
mov x4,x0
mov x0,node_fin // reservation place one element
bl allocHeap
cmp x0,-1 // allocation error
beq 100f
mov x5,x0
str x1,[x5,node_value] // store value in address heap
mov x1,0
str x1,[x5,node_left] // init left pointer with zero
str x1,[x5,node_right] // init right pointer with zero
ldr x2,[x4,tree_size] // load tree size
cbnz x2,1f // 0 element ?
str x5,[x4,tree_root] // yes -> store in root
b 6f
1: // else search free address in tree
ldr x3,[x4,tree_root] // start with address root
add x6,x2,1 // increment tree size
clz x7,x6 // compute zeroes left bits
add x7,x7,1 // for sustract the first left bit
lsl x6,x6,x7 // shift number in left
2:
tst x6,1<<63 // test left bit
lsl x6,x6,1 // shift left bit
bne 3f // bit at one
ldr x1,[x3,node_left] // no store node address in left pointer
cbz x1,4f // if equal zero
mov x3,x1 // else loop with next node
b 2b
3: // yes
ldr x1,[x3,node_right] // store node address in right pointer
cbz x1,5f // if equal zero
mov x3,x1 // else loop with next node
b 2b
4:
str x5,[x3,node_left]
b 6f
5:
str x5,[x3,node_right]
6:
add x2,x2,1 // increment tree size
str x2,[x4,tree_size]
100:
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
/******************************************************************/
/* preOrder */
/******************************************************************/
/* x0 contains the address of the node */
/* x1 function address */
preOrder:
stp x1,lr,[sp,-16]! // save registers
stp x2,x3,[sp,-16]! // save registers
cmp x0,#0
beq 100f
mov x2,x0
blr x1 // call function
ldr x0,[x2,#node_left]
bl preOrder
ldr x0,[x2,#node_right]
bl preOrder
100:
ldp x2,x3,[sp],16 // restaur 2 registers
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
/******************************************************************/
/* inOrder */
/******************************************************************/
/* x0 contains the address of the node */
/* x1 function address */
inOrder:
stp x1,lr,[sp,-16]! // save registers
stp x2,x3,[sp,-16]! // save registers
cbz x0,100f
mov x3,x0
mov x2,x1
ldr x0,[x3,node_left]
bl inOrder
mov x0,x3
blr x2 // call function
ldr x0,[x3,node_right]
mov x1,x2
bl inOrder
100:
ldp x2,x3,[sp],16 // restaur 2 registers
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
/******************************************************************/
/* postOrder */
/******************************************************************/
/* x0 contains the address of the node */
/* x1 function address */
postOrder:
stp x1,lr,[sp,-16]! // save registers
stp x2,x3,[sp,-16]! // save registers
cbz x0,100f
mov x3,x0
mov x2,x1
ldr x0,[x3,#node_left]
bl postOrder
ldr x0,[x3,#node_right]
mov x1,x2
bl postOrder
mov x0,x3
blr x2 // call function
100:
ldp x2,x3,[sp],16 // restaur 2 registers
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
/******************************************************************/
/* levelOrder */
/******************************************************************/
/* x0 contains the address of the node */
/* x1 function address */
levelOrder:
stp x1,lr,[sp,-16]! // save registers
stp x2,x3,[sp,-16]! // save registers
cbz x0,100f
mov x2,x1
mov x1,x0
ldr x0,qAdrstQueue // adresse queue
bl enqueueNode // queue the node
1: // begin loop
ldr x0,qAdrstQueue
bl isEmptyQueue // is queue empty
cbz x0,100f // yes -> end
ldr x0,qAdrstQueue
bl dequeueNode
mov x3,x0 // save node
blr x2 // call function
ldr x14,[x3,#node_left] // left node ok ?
cbz x14,2f
ldr x0,qAdrstQueue // yes -> enqueue
mov x1,x14
bl enqueueNode
2:
ldr x14,[x3,#node_right] // right node ok ?
cbz x14,3f
ldr x0,qAdrstQueue // yes -> enqueue
mov x1,x14
bl enqueueNode
3:
b 1b // and loop
100:
ldp x2,x3,[sp],16 // restaur 2 registers
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
/******************************************************************/
/* display node */
/******************************************************************/
/* x0 contains node address */
displayElement:
stp x1,lr,[sp,-16]! // save registers
ldr x0,[x0,#node_value]
ldr x1,qAdrsZoneConv
bl conversion10S
ldr x0,qAdrszMessResult
ldr x1,qAdrsZoneConv
bl strInsertAtCharInc // insert result at @ character
bl affichageMess
100:
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
qAdrszMessResult: .quad szMessResult
qAdrsZoneConv: .quad sZoneConv
/******************************************************************/
/* enqueue node */
/******************************************************************/
/* x0 contains the address of the queue */
/* x1 contains the value of element */
/* x0 returns address of element or - 1 if error */
enqueueNode:
stp x1,lr,[sp,-16]! // save registers
stp x2,x3,[sp,-16]! // save registers
mov x14,x0
mov x0,#queue_node_fin // allocation place heap
bl allocHeap
cmp x0,#-1 // allocation error
beq 100f
mov x15,x0 // save heap address
str x1,[x15,#queue_node_value] // store node value
mov x1,#0
str x1,[x15,#queue_node_next] // init pointer next
ldr x0,[x14,#queue_end]
cbz x0,1f
str x15,[x0,#queue_node_next]
b 2f
1:
str x15,[x14,#queue_begin]
2:
str x15,[x14,#queue_end]
mov x0,#0
100:
ldp x2,x3,[sp],16 // restaur 2 registers
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
/******************************************************************/
/* dequeue node */
/******************************************************************/
/* x0 contains the address of the queue */
/* x0 returns address of element or - 1 if error */
dequeueNode:
stp x1,lr,[sp,-16]! // save registers
ldr x14,[x0,#queue_begin]
ldr x15,[x14,#queue_node_value]
ldr x16,[x14,#queue_node_next]
str x16,[x0,#queue_begin]
cbnz x16,1f
str x16,[x0,#queue_end]
1:
mov x0,x15
100:
ldp x1,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
/******************************************************************/
/* dequeue node */
/******************************************************************/
/* x0 contains the address of the queue */
/* x0 returns 0 if empty else 1 */
isEmptyQueue:
ldr x0,[x0,#queue_begin]
cmp x0,#0
cset x0,ne
ret // return
/******************************************************************/
/* memory allocation on the heap */
/******************************************************************/
/* x0 contains the size to allocate */
/* x0 returns address of memory heap or - 1 if error */
/* CAUTION : The size of the allowance must be a multiple of 4 */
allocHeap:
stp x8,lr,[sp,-16]! // save registers
// allocation
mov x16,x0 // save size
mov x0,0 // read address start heap
mov x8,BRK // call system 'brk'
svc 0
mov x15,x0 // save address heap for return
add x0,x0,x16 // reservation place for size
mov x8,BRK // call system 'brk'
svc 0
cmp x0,-1 // allocation error
beq 100f
mov x0,x15 // return address memory heap
100:
ldp x8,lr,[sp],16 // restaur 2 registers
ret // return to address lr x30
/***********************************************/
/* File Include fonctions */
/********************************************************/
/* for this file see task include a file in language AArch64 assembly */
.include "../includeARM64.inc"
ACL2
(defun flatten-preorder (tree)
(if (endp tree)
nil
(append (list (first tree))
(flatten-preorder (second tree))
(flatten-preorder (third tree)))))
(defun flatten-inorder (tree)
(if (endp tree)
nil
(append (flatten-inorder (second tree))
(list (first tree))
(flatten-inorder (third tree)))))
(defun flatten-postorder (tree)
(if (endp tree)
nil
(append (flatten-postorder (second tree))
(flatten-postorder (third tree))
(list (first tree)))))
(defun flatten-level-r1 (tree level levels)
(if (endp tree)
levels
(let ((curr (cdr (assoc level levels))))
(flatten-level-r1
(second tree)
(1+ level)
(flatten-level-r1
(third tree)
(1+ level)
(put-assoc level
(append curr (list (first tree)))
levels))))))
(defun flatten-level-r2 (levels max-level)
(declare (xargs :measure (nfix (1+ max-level))))
(if (zp (1+ max-level))
nil
(append (flatten-level-r2 levels
(1- max-level))
(reverse (cdr (assoc max-level levels))))))
(defun flatten-level (tree)
(let ((levels (flatten-level-r1 tree 0 nil)))
(flatten-level-r2 levels (len levels))))
Action!
Action! language does not support recursion. Therefore an iterative approach with a stack has been proposed.
The user must type in the monitor the following command after compilation and before running the program!
SET EndProg=*
CARD EndProg ;required for ALLOCATE.ACT
INCLUDE "D2:ALLOCATE.ACT" ;from the Action! Tool Kit. You must type 'SET EndProg=*' from the monitor after compiling, but before running this program!
DEFINE PTR="CARD"
DEFINE TREE_NODE_SIZE="5"
TYPE TreeNode=[BYTE tData PTR left,right]
DEFINE QUEUE_NODE_SIZE="4"
TYPE QueueNode=[PTR qData,qNext]
DEFINE STACK_NODE_SIZE="4"
TYPE StackNode=[PTR sData,sNext]
Type Tree=[PTR root] ;TreeNode POINTER
TYPE Stack=[PTR top] ;StackNode POINTER
TYPE Queue=[PTR front,rear] ;QueueNode POINTER
PROC QueueInit(Queue POINTER q)
q.front=0 q.rear=0
RETURN
BYTE FUNC QueueIsEmpty(Queue POINTER q)
IF q.front=0 THEN RETURN (1) FI
RETURN (0)
PROC QueuePush(Queue POINTER q TreeNode POINTER d)
QueueNode POINTER node,tmp
node=Alloc(QUEUE_NODE_SIZE)
node.qData=d
node.qNext=0
IF QueueIsEmpty(q) THEN
q.front=node
ELSE
tmp=q.rear
tmp.qNext=node
FI
q.rear=node
RETURN
PTR FUNC QueuePop(Queue POINTER q)
QueueNode POINTER node
TreeNode POINTER d
IF QueueIsEmpty(q) THEN
PrintE("Error: queue is empty!")
Break()
FI
node=q.front
d=node.qData
q.front=node.qNext
Free(node,QUEUE_NODE_SIZE)
RETURN (d)
PROC StackInit(Stack POINTER s)
s.top=0
RETURN
BYTE FUNC StackIsEmpty(Stack POINTER s)
IF s.top=0 THEN
RETURN (1)
FI
RETURN (0)
PROC StackPush(Stack POINTER s TreeNode POINTER d)
StackNode POINTER node
node=Alloc(STACK_NODE_SIZE)
node.sData=d
node.sNext=s.top
s.top=node
RETURN
PTR FUNC StackPop(Stack POINTER s)
StackNode POINTER node
TreeNode POINTER d
IF StackIsEmpty(s) THEN
PrintE("Error stack is empty!")
Break()
FI
node=s.top
d=node.sData
s.top=node.sNext
Free(node,STACK_NODE_SIZE)
RETURN (d)
PTR FUNC CreateTreeNode(BYTE d TreeNode POINTER l,r)
TreeNode POINTER node
node=Alloc(TREE_NODE_SIZE)
node.tData=d
node.left=l
node.right=r
RETURN (node)
PROC BuildTree(Tree POINTER t)
TreeNode POINTER t2,t3,t4,t5,t6,t7,t8,t9
t7=CreateTreeNode(7,0,0)
t4=CreateTreeNode(4,t7,0)
t5=CreateTreeNode(5,0,0)
t2=CreateTreeNode(2,t4,t5)
t8=CreateTreeNode(8,0,0)
t9=CreateTreeNode(9,0,0)
t6=CreateTreeNode(6,t8,t9)
t3=CreateTreeNode(3,t6,0)
t.root=CreateTreeNode(1,t2,t3)
RETURN
PROC DestroyTree(Tree POINTER t)
TreeNode POINTER n
Queue q
IF t.root=0 THEN RETURN FI
QueueInit(q)
QueuePush(q,t.root)
WHILE QueueIsEmpty(q)=0
DO
n=QueuePop(q)
IF n.left#0 THEN
QueuePush(q,n.left)
FI
IF n.right#0 THEN
QueuePush(q,n.right)
FI
Free(n,TREE_NODE_SIZE)
OD
t.root=0
RETURN
PROC VisitNode(TreeNode POINTER n)
PrintB(n.tData) Put(32)
RETURN
PROC PreOrder(Tree POINTER t)
TreeNode POINTER n
Stack s
StackInit(s)
StackPush(s,t.root)
WHILE StackIsEmpty(s)=0
DO
n=StackPop(s)
VisitNode(n)
IF n.right#0 THEN
StackPush(s,n.right)
FI
IF n.left#0 THEN
StackPush(s,n.left)
FI
OD
RETURN
PROC InOrder(Tree POINTER t)
TreeNode POINTER n
Stack s
StackInit(s)
n=t.root
DO
DO
IF n.right#0 THEN
StackPush(s,n.right)
FI
StackPush(s,n)
IF n.left#0 THEN
n=n.left
ELSE
EXIT
FI
OD
n=StackPop(s)
WHILE StackIsEmpty(s)=0 AND n.right=0
DO
VisitNode(n)
n=StackPop(s)
OD
VisitNode(n)
IF StackIsEmpty(s) THEN EXIT FI
n=StackPop(s)
OD
RETURN
PROC PostOrder(Tree POINTER t)
TreeNode POINTER n
Stack s,tmp
StackInit(s)
StackInit(tmp)
StackPush(s,t.root)
WHILE StackIsEmpty(s)=0
DO
n=StackPop(s)
StackPush(tmp,n)
IF n.left#0 THEN
StackPush(s,n.left)
FI
IF n.right#0 THEN
StackPush(s,n.right)
FI
OD
WHILE StackIsEmpty(tmp)=0
DO
n=StackPop(tmp)
VisitNode(n)
OD
RETURN
PROC LevelOrder(Tree POINTER t)
TreeNode POINTER n
Queue q
QueueInit(q)
QueuePush(q,t.root)
WHILE QueueIsEmpty(q)=0
DO
n=QueuePop(q)
IF n.left#0 THEN
QueuePush(q,n.left)
FI
IF n.right#0 THEN
QueuePush(q,n.right)
FI
VisitNode(n)
OD
RETURN
PROC Main()
Tree t
Put(125) PutE() ;clear screen
AllocInit(0)
BuildTree(t)
Print("pre-order: ") PreOrder(t) PutE()
Print("in-order: ") InOrder(t) PutE()
Print("post-order: ") PostOrder(t) PutE()
Print("level-order: ") LevelOrder(t) PutE()
DestroyTree(t)
RETURN
- Output:
Screenshot from Atari 8-bit computer
pre-order: 1 2 4 7 5 3 6 8 9 in-order: 7 4 2 5 1 8 6 9 3 post-order: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
Ada
with Ada.Text_Io; use Ada.Text_Io;
with Ada.Unchecked_Deallocation;
with Ada.Containers.Doubly_Linked_Lists;
procedure Tree_Traversal is
type Node;
type Node_Access is access Node;
type Node is record
Left : Node_Access := null;
Right : Node_Access := null;
Data : Integer;
end record;
procedure Destroy_Tree(N : in out Node_Access) is
procedure free is new Ada.Unchecked_Deallocation(Node, Node_Access);
begin
if N.Left /= null then
Destroy_Tree(N.Left);
end if;
if N.Right /= null then
Destroy_Tree(N.Right);
end if;
Free(N);
end Destroy_Tree;
function Tree(Value : Integer; Left : Node_Access; Right : Node_Access) return Node_Access is
Temp : Node_Access := new Node;
begin
Temp.Data := Value;
Temp.Left := Left;
Temp.Right := Right;
return Temp;
end Tree;
procedure Preorder(N : Node_Access) is
begin
Put(Integer'Image(N.Data));
if N.Left /= null then
Preorder(N.Left);
end if;
if N.Right /= null then
Preorder(N.Right);
end if;
end Preorder;
procedure Inorder(N : Node_Access) is
begin
if N.Left /= null then
Inorder(N.Left);
end if;
Put(Integer'Image(N.Data));
if N.Right /= null then
Inorder(N.Right);
end if;
end Inorder;
procedure Postorder(N : Node_Access) is
begin
if N.Left /= null then
Postorder(N.Left);
end if;
if N.Right /= null then
Postorder(N.Right);
end if;
Put(Integer'Image(N.Data));
end Postorder;
procedure Levelorder(N : Node_Access) is
package Queues is new Ada.Containers.Doubly_Linked_Lists(Node_Access);
use Queues;
Node_Queue : List;
Next : Node_Access;
begin
Node_Queue.Append(N);
while not Is_Empty(Node_Queue) loop
Next := First_Element(Node_Queue);
Delete_First(Node_Queue);
Put(Integer'Image(Next.Data));
if Next.Left /= null then
Node_Queue.Append(Next.Left);
end if;
if Next.Right /= null then
Node_Queue.Append(Next.Right);
end if;
end loop;
end Levelorder;
N : Node_Access;
begin
N := Tree(1,
Tree(2,
Tree(4,
Tree(7, null, null),
null),
Tree(5, null, null)),
Tree(3,
Tree(6,
Tree(8, null, null),
Tree(9, null, null)),
null));
Put("preorder: ");
Preorder(N);
New_Line;
Put("inorder: ");
Inorder(N);
New_Line;
Put("postorder: ");
Postorder(N);
New_Line;
Put("level order: ");
Levelorder(N);
New_Line;
Destroy_Tree(N);
end Tree_traversal;
Agda
open import Data.List using (List; _?_; []; concat)
open import Data.Nat using (N; suc; zero)
open import Level using (Level)
open import Relation.Binary.PropositionalEquality using (_=_; refl)
data Tree {a} (A : Set a) : Set a where
leaf : Tree A
node : A ? Tree A ? Tree A ? Tree A
variable
a : Level
A : Set a
preorder : Tree A ? List A
preorder tr = go tr []
where
go : Tree A ? List A ? List A
go leaf ys = ys
go (node x ls rs) ys = x ? go ls (go rs ys)
inorder : Tree A ? List A
inorder tr = go tr []
where
go : Tree A ? List A ? List A
go leaf ys = ys
go (node x ls rs) ys = go ls (x ? go rs ys)
postorder : Tree A ? List A
postorder tr = go tr []
where
go : Tree A ? List A ? List A
go leaf ys = ys
go (node x ls rs) ys = go ls (go rs (x ? ys))
level-order : Tree A ? List A
level-order tr = concat (go tr [])
where
go : Tree A ? List (List A) ? List (List A)
go leaf qs = qs
go (node x ls rs) [] = (x ? []) ? go ls (go rs [])
go (node x ls rs) (q ? qs) = (x ? q ) ? go ls (go rs qs)
example-tree : Tree N
example-tree =
node 1
(node 2
(node 4
(node 7
leaf
leaf)
leaf)
(node 5
leaf
leaf))
(node 3
(node 6
(node 8
leaf
leaf)
(node 9
leaf
leaf))
leaf)
_ : preorder example-tree = 1 ? 2 ? 4 ? 7 ? 5 ? 3 ? 6 ? 8 ? 9 ? []
_ = refl
_ : inorder example-tree = 7 ? 4 ? 2 ? 5 ? 1 ? 8 ? 6 ? 9 ? 3 ? []
_ = refl
_ : postorder example-tree = 7 ? 4 ? 5 ? 2 ? 8 ? 9 ? 6 ? 3 ? 1 ? []
_ = refl
_ : level-order example-tree = 1 ? 2 ? 3 ? 4 ? 5 ? 6 ? 7 ? 8 ? 9 ? []
_ = refl
ALGOL 68
- note the strong code structural similarities with C.
Note the changes from the original translation from C in this diff. It contains examples of syntactic sugar available in ALGOL 68.
MODE VALUE = INT;
PROC value repr = (VALUE value)STRING: whole(value, 0);
MODE NODES = STRUCT ( VALUE value, REF NODES left, right);
MODE NODE = REF NODES;
PROC tree = (VALUE value, NODE left, right)NODE:
HEAP NODES := (value, left, right);
PROC preorder = (NODE node, PROC (VALUE)VOID action)VOID:
IF node ISNT NODE(NIL) THEN
action(value OF node);
preorder(left OF node, action);
preorder(right OF node, action)
FI;
PROC inorder = (NODE node, PROC (VALUE)VOID action)VOID:
IF node ISNT NODE(NIL) THEN
inorder(left OF node, action);
action(value OF node);
inorder(right OF node, action)
FI;
PROC postorder = (NODE node, PROC (VALUE)VOID action)VOID:
IF node ISNT NODE(NIL) THEN
postorder(left OF node, action);
postorder(right OF node, action);
action(value OF node)
FI;
PROC destroy tree = (NODE node)VOID:
postorder(node, (VALUE skip)VOID:
# free(node) - PR garbage collect hint PR #
node := (SKIP, NIL, NIL)
);
# helper queue for level order #
MODE QNODES = STRUCT (REF QNODES next, NODE value);
MODE QNODE = REF QNODES;
MODE QUEUES = STRUCT (QNODE begin, end);
MODE QUEUE = REF QUEUES;
PROC enqueue = (QUEUE queue, NODE node)VOID:
(
HEAP QNODES qnode := (NIL, node);
IF end OF queue ISNT QNODE(NIL) THEN
next OF end OF queue
ELSE
begin OF queue
FI := end OF queue := qnode
);
PROC queue empty = (QUEUE queue)BOOL:
begin OF queue IS QNODE(NIL);
PROC dequeue = (QUEUE queue)NODE:
(
NODE out := value OF begin OF queue;
QNODE second := next OF begin OF queue;
# free(begin OF queue); PR garbage collect hint PR #
QNODE(begin OF queue) := (NIL, NIL);
begin OF queue := second;
IF queue empty(queue) THEN
end OF queue := begin OF queue
FI;
out
);
PROC level order = (NODE node, PROC (VALUE)VOID action)VOID:
(
HEAP QUEUES queue := (QNODE(NIL), QNODE(NIL));
enqueue(queue, node);
WHILE NOT queue empty(queue)
DO
NODE next := dequeue(queue);
IF next ISNT NODE(NIL) THEN
action(value OF next);
enqueue(queue, left OF next);
enqueue(queue, right OF next)
FI
OD
);
PROC print node = (VALUE value)VOID:
print((" ",value repr(value)));
main: (
NODE node := tree(1,
tree(2,
tree(4,
tree(7, NIL, NIL),
NIL),
tree(5, NIL, NIL)),
tree(3,
tree(6,
tree(8, NIL, NIL),
tree(9, NIL, NIL)),
NIL));
MODE TEST = STRUCT(
STRING name,
PROC(NODE,PROC(VALUE)VOID)VOID order
);
PROC test = (TEST test)VOID:(
STRING pad=" "*(12-UPB name OF test);
print((name OF test,pad,": "));
(order OF test)(node, print node);
print(new line)
);
[]TEST test list = (
("preorder",preorder),
("inorder",inorder),
("postorder",postorder),
("level order",level order)
);
FOR i TO UPB test list DO test(test list[i]) OD;
destroy tree(node)
)
Output:
preorder : 1 2 4 7 5 3 6 8 9 inorder : 7 4 2 5 1 8 6 9 3 postorder : 7 4 5 2 8 9 6 3 1 level-order : 1 2 3 4 5 6 7 8 9
APL
Written in Dyalog APL with dfns.
preorder ? {l r?? ?? ? ? (?r)???(×?r)?(?l)???(×?l)?? ?? ?}
inorder ? {l r?? ?? ? ? (?r)???(×?r)?? ???(?l)???(×?l)??}
postorder? {l r?? ?? ? ? ? ???(?r)???(×?r)?(?l)???(×?l)??}
lvlorder ? {0=??:? ? (????/(??),??)??°(,/)?2??°??¨?}
These accept four arguments (they are operators, a.k.a. higher-order functions):
acc visit ___order children bintree
returns the accumulator after visiting each node in the order specified by the function.
"acc" is the initial value for the accumulator, and "bintree" is usually the tree to be searched (it is actually the the initial argument fed to visit and children, which in most cases corresponds to the root node and the rest of the tree).
"visit" and "children" are two functions which allow these operators to work on any representation of a tree you can cook up.
"visit" takes the accumulator on the left and the current node data on the right, and returns the modified accumulator (it visits the node).
"children" generates the children of the current node from the current node's data on the right, and the current state of the accumulator on the left if needed.
"pre-", "in-", and "postorder" all work in the same way. First "children" returns the left and right children in "l" and "r", both in a "wrapper" (sort of like the Maybe type in Haskell from the little I know of it). Then the whole function is recursively applied to the left and right children if they're there, and visit is run on the current node. The order of those three operations is what differs in the three operators. Therefor if the current node possesses neither child, then the recursion ends for that branch.
"lvlorder" is a little different. The right argument is actually a list of initial nodes considered at the top level (usually this will just be a list of one element which is the tree). First all the nodes in this list are visited, then the children of each of these nodes are generated and assembled into a single list. The accumulator and this list are passed to the same function recursively, until the list of children nodes to visit is empty. This function is tail-recursive.
Time for an example to clarify all this.
I chose to represent the description's tree using nested arrays (rectangular arrays whose elements can also be rectangular arrays). Each node is of the form
value childL childR
and empty childL or childR mean and absence of the corresponding child node.
tree?1(2(4(7??)?)(5??))(3(6(8??)(9??))?)
visit?{?,(×??)???}
children?{?¨@(×°?¨)1??}
Each time the accumulator is initialised as an empty list. Visiting a node means to append its data to the accumulator, and generating children is fetching the two corresponding sublists in the nested array if they're non-empty.
My input into the interactive APL session is indented by 6 spaces.
? visit preorder children tree 1 2 4 7 5 3 6 8 9 ? visit inorder children tree 7 4 2 5 1 8 6 9 3 ? visit postorder children tree 7 4 5 2 8 9 6 3 1 ? visit lvlorder children ,?tree 1 2 3 4 5 6 7 8 9
These solutions were inspired by the DFS lesson on www.TryApl.org
You should go check it out, as in the lesson it is explained how to implement a DFS operator taking the same two functions as the operators here. What is remarkable is that these same searching operators can be used both on an actual tree data structure, and on an "imaginary" one as well such as the tree of solutions to the N-Queens problem. This is the example used on TryApl.org.
AppleScript
(ES6)
on run
-- Sample tree of integers
set tree to node(1, ¬
{node(2, ¬
{node(4, {node(7, {})}), ¬
node(5, {})}), ¬
node(3, ¬
{node(6, {node(8, {}), ¬
node(9, {})})})})
-- Output of AppleScript code at Rosetta Code task
-- 'Visualize a Tree':
set strTree to unlines({¬
" + 4 - 7", ¬
" + 2 ¦", ¬
" ¦ + 5", ¬
" 1 ¦", ¬
" ¦ + 8", ¬
" + 3 - 6 ¦", ¬
" + 9"})
script tabulate
on |?|(s, xs)
justifyRight(14, space, s & ": ") & unwords(xs)
end |?|
end script
set strResult to strTree & linefeed & unlines(zipWith(tabulate, ¬
["preorder", "inorder", "postorder", "level-order"], ¬
apList([¬
foldTree(preorder), ¬
foldTree(inorder), ¬
foldTree(postorder), ¬
levelOrder], [tree])))
set the clipboard to strResult
return strResult
end run
---------------------- TREE TRAVERSAL ----------------------
-- preorder :: a -> [[a]] -> [a]
on preorder(x, xs)
{x} & concat(xs)
end preorder
-- inorder :: a -> [[a]] -> [a]
on inorder(x, xs)
if {} ? xs then
item 1 of xs & x & concat(rest of xs)
else
{x}
end if
end inorder
-- postorder :: a -> [[a]] -> [a]
on postorder(x, xs)
concat(xs) & {x}
end postorder
-- levelOrder :: Tree a -> [a]
on levelOrder(tree)
concat(levels(tree))
end levelOrder
-- foldTree :: (a -> [b] -> b) -> Tree a -> b
on foldTree(f)
script
on |?|(tree)
script go
property g : |?| of mReturn(f)
on |?|(oNode)
g(root of oNode, |?|(nest of oNode) ¬
of map(go))
end |?|
end script
|?|(tree) of go
end |?|
end script
end foldTree
------------------------- GENERIC --------------------------
-- Node :: a -> [Tree a] -> Tree a
on node(v, xs)
{type:"Node", root:v, nest:xs}
end node
-- e.g. [(*2),(/2), sqrt] <*> [1,2,3]
-- --> ap([dbl, hlf, root], [1, 2, 3])
-- --> [2,4,6,0.5,1,1.5,1,1.4142135623730951,1.7320508075688772]
-- Each member of a list of functions applied to
-- each of a list of arguments, deriving a list of new values
-- apList (<*>) :: [(a -> b)] -> [a] -> [b]
on apList(fs, xs)
set lst to {}
repeat with f in fs
tell mReturn(contents of f)
repeat with x in xs
set end of lst to |?|(contents of x)
end repeat
end tell
end repeat
return lst
end apList
-- concat :: [[a]] -> [a]
-- concat :: [String] -> String
on concat(xs)
set lng to length of xs
if 0 < lng and string is class of (item 1 of xs) then
set acc to ""
else
set acc to {}
end if
repeat with i from 1 to lng
set acc to acc & item i of xs
end repeat
acc
end concat
-- foldr :: (a -> b -> b) -> b -> [a] -> b
on foldr(f, startValue, xs)
tell mReturn(f)
set v to startValue
set lng to length of xs
repeat with i from lng to 1 by -1
set v to |?|(item i of xs, v, i, xs)
end repeat
return v
end tell
end foldr
-- justifyRight :: Int -> Char -> String -> String
on justifyRight(n, cFiller, strText)
if n > length of strText then
text -n thru -1 of ((replicate(n, cFiller) as text) & strText)
else
strText
end if
end justifyRight
-- length :: [a] -> Int
on |length|(xs)
set c to class of xs
if list is c or string is c then
length of xs
else
(2 ^ 29 - 1) -- (maxInt - simple proxy for non-finite)
end if
end |length|
-- levels :: Tree a -> [[a]]
on levels(tree)
-- A list of lists, grouping the root
-- values of each level of the tree.
script go
on |?|(node, a)
if {} ? a then
tell a to set {h, t} to {item 1, rest}
else
set {h, t} to {{}, {}}
end if
{{root of node} & h} & foldr(go, t, nest of node)
end |?|
end script
|?|(tree, {}) of go
end levels
-- mReturn :: First-class m => (a -> b) -> m (a -> b)
on mReturn(f)
-- 2nd class handler function lifted into 1st class script wrapper.
if script is class of f then
f
else
script
property |?| : f
end script
end if
end mReturn
-- map :: (a -> b) -> [a] -> [b]
on map(f)
-- The list obtained by applying f
-- to each element of xs.
script
on |?|(xs)
tell mReturn(f)
set lng to length of xs
set lst to {}
repeat with i from 1 to lng
set end of lst to |?|(item i of xs, i, xs)
end repeat
return lst
end tell
end |?|
end script
end map
-- min :: Ord a => a -> a -> a
on min(x, y)
if y < x then
y
else
x
end if
end min
-- nest :: Tree a -> [a]
on nest(oTree)
nest of oTree
end nest
-- Egyptian multiplication - progressively doubling a list, appending
-- stages of doubling to an accumulator where needed for binary
-- assembly of a target length
-- replicate :: Int -> a -> [a]
on replicate(n, a)
set out to {}
if 1 > n then return out
set dbl to {a}
repeat while (1 < n)
if 0 < (n mod 2) then set out to out & dbl
set n to (n div 2)
set dbl to (dbl & dbl)
end repeat
return out & dbl
end replicate
-- root :: Tree a -> a
on root(oTree)
root of oTree
end root
-- take :: Int -> [a] -> [a]
-- take :: Int -> String -> String
on take(n, xs)
set c to class of xs
if list is c then
if 0 < n then
items 1 thru min(n, length of xs) of xs
else
{}
end if
else if string is c then
if 0 < n then
text 1 thru min(n, length of xs) of xs
else
""
end if
else if script is c then
set ys to {}
repeat with i from 1 to n
set v to |?|() of xs
if missing value is v then
return ys
else
set end of ys to v
end if
end repeat
return ys
else
missing value
end if
end take
-- unlines :: [String] -> String
on unlines(xs)
-- A single string formed by the intercalation
-- of a list of strings with the newline character.
set {dlm, my text item delimiters} to ¬
{my text item delimiters, linefeed}
set str to xs as text
set my text item delimiters to dlm
str
end unlines
-- unwords :: [String] -> String
on unwords(xs)
set {dlm, my text item delimiters} to ¬
{my text item delimiters, space}
set s to xs as text
set my text item delimiters to dlm
return s
end unwords
-- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
on zipWith(f, xs, ys)
set lng to min(|length|(xs), |length|(ys))
if 1 > lng then return {}
set xs_ to take(lng, xs) -- Allow for non-finite
set ys_ to take(lng, ys) -- generators like cycle etc
set lst to {}
tell mReturn(f)
repeat with i from 1 to lng
set end of lst to |?|(item i of xs_, item i of ys_)
end repeat
return lst
end tell
end zipWith
- Output:
+ 4 - 7 + 2 ¦ ¦ + 5 1 ¦ ¦ + 8 + 3 - 6 ¦ + 9 preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
ARM Assembly
/* ARM assembly Raspberry PI */
/* program deftree2.s */
/* Constantes */
.equ STDOUT, 1 @ Linux output console
.equ EXIT, 1 @ Linux syscall
.equ READ, 3
.equ WRITE, 4
.equ NBVAL, 9
/*******************************************/
/* Structures */
/********************************************/
/* structure tree */
.struct 0
tree_root: @ root pointer
.struct tree_root + 4
tree_size: @ number of element of tree
.struct tree_size + 4
tree_fin:
/* structure node tree */
.struct 0
node_left: @ left pointer
.struct node_left + 4
node_right: @ right pointer
.struct node_right + 4
node_value: @ element value
.struct node_value + 4
node_fin:
/* structure queue*/
.struct 0
queue_begin: @ next pointer
.struct queue_begin + 4
queue_end: @ element value
.struct queue_end + 4
queue_fin:
/* structure node queue */
.struct 0
queue_node_next: @ next pointer
.struct queue_node_next + 4
queue_node_value: @ element value
.struct queue_node_value + 4
queue_node_fin:
/* Initialized data */
.data
szMessInOrder: .asciz "inOrder :\n"
szMessPreOrder: .asciz "PreOrder :\n"
szMessPostOrder: .asciz "PostOrder :\n"
szMessLevelOrder: .asciz "LevelOrder :\n"
szCarriageReturn: .asciz "\n"
/* datas error display */
szMessErreur: .asciz "Error detected.\n"
/* datas message display */
szMessResult: .ascii "Element value :"
sValue: .space 12,' '
.asciz "\n"
/* UnInitialized data */
.bss
stTree: .skip tree_fin @ place to structure tree
stQueue: .skip queue_fin @ place to structure queue
/* code section */
.text
.global main
main:
mov r1,#1 @ node tree value
1:
ldr r0,iAdrstTree @ structure tree address
bl insertElement @ add element value r1
cmp r0,#-1
beq 99f
add r1,#1 @ increment value
cmp r1,#NBVAL @ end ?
ble 1b @ no -> loop
ldr r0,iAdrszMessPreOrder
bl affichageMess
ldr r3,iAdrstTree @ tree root address (begin structure)
ldr r0,[r3,#tree_root]
ldr r1,iAdrdisplayElement @ function to execute
bl preOrder
ldr r0,iAdrszMessInOrder
bl affichageMess
ldr r3,iAdrstTree
ldr r0,[r3,#tree_root]
ldr r1,iAdrdisplayElement @ function to execute
bl inOrder
ldr r0,iAdrszMessPostOrder
bl affichageMess
ldr r3,iAdrstTree
ldr r0,[r3,#tree_root]
ldr r1,iAdrdisplayElement @ function to execute
bl postOrder
ldr r0,iAdrszMessLevelOrder
bl affichageMess
ldr r3,iAdrstTree
ldr r0,[r3,#tree_root]
ldr r1,iAdrdisplayElement @ function to execute
bl levelOrder
b 100f
99: @ display error
ldr r0,iAdrszMessErreur
bl affichageMess
100: @ standard end of the program
mov r7, #EXIT @ request to exit program
svc 0 @ perform system call
iAdrszMessInOrder: .int szMessInOrder
iAdrszMessPreOrder: .int szMessPreOrder
iAdrszMessPostOrder: .int szMessPostOrder
iAdrszMessLevelOrder: .int szMessLevelOrder
iAdrszMessErreur: .int szMessErreur
iAdrszCarriageReturn: .int szCarriageReturn
iAdrstTree: .int stTree
iAdrstQueue: .int stQueue
iAdrdisplayElement: .int displayElement
/******************************************************************/
/* insert element in the tree */
/******************************************************************/
/* r0 contains the address of the tree structure */
/* r1 contains the value of element */
/* r0 returns address of element or - 1 if error */
insertElement:
push {r1-r7,lr} @ save registers
mov r4,r0
mov r0,#node_fin @ reservation place one element
bl allocHeap
cmp r0,#-1 @ allocation error
beq 100f
mov r5,r0
str r1,[r5,#node_value] @ store value in address heap
mov r1,#0
str r1,[r5,#node_left] @ init left pointer with zero
str r1,[r5,#node_right] @ init right pointer with zero
ldr r2,[r4,#tree_size] @ load tree size
cmp r2,#0 @ 0 element ?
bne 1f
str r5,[r4,#tree_root] @ yes -> store in root
b 4f
1: @ else search free address in tree
ldr r3,[r4,#tree_root] @ start with address root
add r6,r2,#1 @ increment tree size
clz r7,r6 @ compute zeroes left bits
add r7,#1 @ for sustract the first left bit
lsl r6,r7 @ shift number in left
2:
lsls r6,#1 @ read left bit
bcs 3f @ is 1 ?
ldr r1,[r3,#node_left] @ no store node address in left pointer
cmp r1,#0 @ if equal zero
streq r5,[r3,#node_left]
beq 4f
mov r3,r1 @ else loop with next node
b 2b
3: @ yes
ldr r1,[r3,#node_right] @ store node address in right pointer
cmp r1,#0 @ if equal zero
streq r5,[r3,#node_right]
beq 4f
mov r3,r1 @ else loop with next node
b 2b
4:
add r2,#1 @ increment tree size
str r2,[r4,#tree_size]
100:
pop {r1-r7,lr} @ restaur registers
bx lr @ return
/******************************************************************/
/* preOrder */
/******************************************************************/
/* r0 contains the address of the node */
/* r1 function address */
preOrder:
push {r1-r2,lr} @ save registers
cmp r0,#0
beq 100f
mov r2,r0
blx r1 @ call function
ldr r0,[r2,#node_left]
bl preOrder
ldr r0,[r2,#node_right]
bl preOrder
100:
pop {r1-r2,lr} @ restaur registers
bx lr
/******************************************************************/
/* inOrder */
/******************************************************************/
/* r0 contains the address of the node */
/* r1 function address */
inOrder:
push {r1-r3,lr} @ save registers
cmp r0,#0
beq 100f
mov r3,r0
mov r2,r1
ldr r0,[r3,#node_left]
bl inOrder
mov r0,r3
blx r2 @ call function
ldr r0,[r3,#node_right]
mov r1,r2
bl inOrder
100:
pop {r1-r3,lr} @ restaur registers
bx lr @ return
/******************************************************************/
/* postOrder */
/******************************************************************/
/* r0 contains the address of the node */
/* r1 function address */
postOrder:
push {r1-r3,lr} @ save registers
cmp r0,#0
beq 100f
mov r3,r0
mov r2,r1
ldr r0,[r3,#node_left]
bl postOrder
ldr r0,[r3,#node_right]
mov r1,r2
bl postOrder
mov r0,r3
blx r2 @ call function
100:
pop {r1-r3,lr} @ restaur registers
bx lr @ return
/******************************************************************/
/* levelOrder */
/******************************************************************/
/* r0 contains the address of the node */
/* r1 function address */
levelOrder:
push {r1-r4,lr} @ save registers
cmp r0,#0
beq 100f
mov r2,r1
mov r1,r0
ldr r0,iAdrstQueue @ adresse queue
bl enqueueNode @ queue the node
1: @ begin loop
ldr r0,iAdrstQueue
bl isEmptyQueue @ is queue empty
cmp r0,#0
beq 100f @ yes -> end
ldr r0,iAdrstQueue
bl dequeueNode
mov r3,r0 @ save node
blx r2 @ call function
ldr r4,[r3,#node_left] @ left node ok ?
cmp r4,#0
beq 2f @ no
ldr r0,iAdrstQueue @ yes -> enqueue
mov r1,r4
bl enqueueNode
2:
ldr r4,[r3,#node_right] @ right node ok ?
cmp r4,#0
beq 3f @ no
ldr r0,iAdrstQueue @ yes -> enqueue
mov r1,r4
bl enqueueNode
3:
b 1b @ and loop
100:
pop {r1-r4,lr} @ restaur registers
bx lr @ return
/******************************************************************/
/* display node */
/******************************************************************/
/* r0 contains node address */
displayElement:
push {r1,lr} @ save registers
ldr r0,[r0,#node_value]
ldr r1,iAdrsValue
bl conversion10S
ldr r0,iAdrszMessResult
bl affichageMess
100:
pop {r1,lr} @ restaur registers
bx lr @ return
iAdrszMessResult: .int szMessResult
iAdrsValue: .int sValue
/******************************************************************/
/* enqueue node */
/******************************************************************/
/* r0 contains the address of the queue */
/* r1 contains the value of element */
/* r0 returns address of element or - 1 if error */
enqueueNode:
push {r1-r5,lr} @ save registers
mov r4,r0
mov r0,#queue_node_fin @ allocation place heap
bl allocHeap
cmp r0,#-1 @ allocation error
beq 100f
mov r5,r0 @ save heap address
str r1,[r5,#queue_node_value] @ store node value
mov r1,#0
str r1,[r5,#queue_node_next] @ init pointer next
ldr r0,[r4,#queue_end]
cmp r0,#0
strne r5,[r0,#queue_node_next]
streq r5,[r4,#queue_begin]
str r5,[r4,#queue_end]
mov r0,#0
pop {r1-r5,lr}
bx lr @ return
/******************************************************************/
/* dequeue node */
/******************************************************************/
/* r0 contains the address of the queue */
/* r0 returns address of element or - 1 if error */
dequeueNode:
push {r1-r5,lr} @ save registers
ldr r4,[r0,#queue_begin]
ldr r5,[r4,#queue_node_value]
ldr r6,[r4,#queue_node_next]
str r6,[r0,#queue_begin]
cmp r6,#0
streq r6,[r0,#queue_end]
mov r0,r5
100:
pop {r1-r5,lr}
bx lr @ return
/******************************************************************/
/* dequeue node */
/******************************************************************/
/* r0 contains the address of the queue */
/* r0 returns 0 if empty else 1 */
isEmptyQueue:
ldr r0,[r0,#queue_begin]
cmp r0,#0
movne r0,#1
bx lr @ return
/******************************************************************/
/* memory allocation on the heap */
/******************************************************************/
/* r0 contains the size to allocate */
/* r0 returns address of memory heap or - 1 if error */
/* CAUTION : The size of the allowance must be a multiple of 4 */
allocHeap:
push {r5-r7,lr} @ save registers
@ allocation
mov r6,r0 @ save size
mov r0,#0 @ read address start heap
mov r7,#0x2D @ call system 'brk'
svc #0
mov r5,r0 @ save address heap for return
add r0,r6 @ reservation place for size
mov r7,#0x2D @ call system 'brk'
svc #0
cmp r0,#-1 @ allocation error
movne r0,r5 @ return address memory heap
pop {r5-r7,lr} @ restaur registers
bx lr @ return
/******************************************************************/
/* display text with size calculation */
/******************************************************************/
/* r0 contains the address of the message */
affichageMess:
push {r0,r1,r2,r7,lr} @ save registers
mov r2,#0 @ counter length */
1: @ loop length calculation
ldrb r1,[r0,r2] @ read octet start position + index
cmp r1,#0 @ if 0 its over
addne r2,r2,#1 @ else add 1 in the length
bne 1b @ and loop
@ so here r2 contains the length of the message
mov r1,r0 @ address message in r1
mov r0,#STDOUT @ code to write to the standard output Linux
mov r7, #WRITE @ code call system "write"
svc #0 @ call system
pop {r0,r1,r2,r7,lr} @ restaur registers
bx lr @ return
/***************************************************/
/* Converting a register to a signed decimal */
/***************************************************/
/* r0 contains value and r1 area address */
conversion10S:
push {r0-r4,lr} @ save registers
mov r2,r1 @ debut zone stockage
mov r3,#'+' @ par defaut le signe est +
cmp r0,#0 @ negative number ?
movlt r3,#'-' @ yes
mvnlt r0,r0 @ number inversion
addlt r0,#1
mov r4,#10 @ length area
1: @ start loop
bl divisionpar10U
add r1,#48 @ digit
strb r1,[r2,r4] @ store digit on area
sub r4,r4,#1 @ previous position
cmp r0,#0 @ stop if quotient = 0
bne 1b
strb r3,[r2,r4] @ store signe
subs r4,r4,#1 @ previous position
blt 100f @ if r4 < 0 -> end
mov r1,#' ' @ space
2:
strb r1,[r2,r4] @store byte space
subs r4,r4,#1 @ previous position
bge 2b @ loop if r4 > 0
100:
pop {r0-r4,lr} @ restaur registers
bx lr
/***************************************************/
/* division par 10 unsigned */
/***************************************************/
/* r0 dividende */
/* r0 quotient */
/* r1 remainder */
divisionpar10U:
push {r2,r3,r4, lr}
mov r4,r0 @ save value
//mov r3,#0xCCCD @ r3 <- magic_number lower raspberry 3
//movt r3,#0xCCCC @ r3 <- magic_number higter raspberry 3
ldr r3,iMagicNumber @ r3 <- magic_number raspberry 1 2
umull r1, r2, r3, r0 @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0)
mov r0, r2, LSR #3 @ r2 <- r2 >> shift 3
add r2,r0,r0, lsl #2 @ r2 <- r0 * 5
sub r1,r4,r2, lsl #1 @ r1 <- r4 - (r2 * 2) = r4 - (r0 * 10)
pop {r2,r3,r4,lr}
bx lr @ leave function
iMagicNumber: .int 0xCCCCCCCD
- Output:
PreOrder : Element value : +1 Element value : +2 Element value : +4 Element value : +8 Element value : +9 Element value : +5 Element value : +3 Element value : +6 Element value : +7 inOrder : Element value : +8 Element value : +4 Element value : +9 Element value : +2 Element value : +5 Element value : +1 Element value : +6 Element value : +3 Element value : +7 PostOrder : Element value : +8 Element value : +9 Element value : +4 Element value : +5 Element value : +2 Element value : +6 Element value : +7 Element value : +3 Element value : +1 LevelOrder : Element value : +1 Element value : +2 Element value : +3 Element value : +4 Element value : +5 Element value : +6 Element value : +7 Element value : +8 Element value : +9
ATS
#include
"share/atspre_staload.hats"
//
(* ****** ****** *)
//
datatype
tree (a:t@ype) =
| tnil of ()
| tcons of (tree a, a, tree a)
//
(* ****** ****** *)
symintr ++
infixr (+) ++
overload ++ with list_append
(* ****** ****** *)
#define sing list_sing
(* ****** ****** *)
fun{
a:t@ype
} preorder
(t0: tree a): List0 a =
case t0 of
| tnil () => nil ()
| tcons (tl, x, tr) => sing(x) ++ preorder(tl) ++ preorder(tr)
(* ****** ****** *)
fun{
a:t@ype
} inorder
(t0: tree a): List0 a =
case t0 of
| tnil () => nil ()
| tcons (tl, x, tr) => inorder(tl) ++ sing(x) ++ inorder(tr)
(* ****** ****** *)
fun{
a:t@ype
} postorder
(t0: tree a): List0 a =
case t0 of
| tnil () => nil ()
| tcons (tl, x, tr) => postorder(tl) ++ postorder(tr) ++ sing(x)
(* ****** ****** *)
fun{
a:t@ype
} levelorder
(t0: tree a): List0 a = let
//
fun auxlst
(ts: List (tree(a))): List0 a =
case ts of
| list_nil () => list_nil ()
| list_cons (t, ts) =>
(
case+ t of
| tnil () => auxlst (ts)
| tcons (tl, x, tr) => cons (x, auxlst (ts ++ $list{tree(a)}(tl, tr)))
)
//
in
auxlst (sing(t0))
end // end of [levelorder]
(* ****** ****** *)
macdef
tsing(x) = tcons (tnil, ,(x), tnil)
(* ****** ****** *)
implement
main0 () = let
//
val t0 =
tcons{int}
(
tcons (tcons (tsing (7), 4, tnil ()), 2, tsing (5))
,
1
,
tcons (tcons (tsing (8), 6, tsing (9)), 3, tnil ())
)
//
in
println! ("preorder:\t", preorder(t0));
println! ("inorder:\t", inorder(t0));
println! ("postorder:\t", postorder(t0));
println! ("level-order:\t", levelorder(t0));
end (* end of [main0] *)
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
AutoHotkey
AddNode(Tree,1,2,3,1) ; Build global Tree
AddNode(Tree,2,4,5,2)
AddNode(Tree,3,6,0,3)
AddNode(Tree,4,7,0,4)
AddNode(Tree,5,0,0,5)
AddNode(Tree,6,8,9,6)
AddNode(Tree,7,0,0,7)
AddNode(Tree,8,0,0,8)
AddNode(Tree,9,0,0,9)
MsgBox % "Preorder: " PreOrder(Tree,1) ; 1 2 4 7 5 3 6 8 9
MsgBox % "Inorder: " InOrder(Tree,1) ; 7 4 2 5 1 8 6 9 3
MsgBox % "postorder: " PostOrder(Tree,1) ; 7 4 5 2 8 9 6 3 1
MsgBox % "levelorder: " LevOrder(Tree,1) ; 1 2 3 4 5 6 7 8 9
AddNode(ByRef Tree,Node,Left,Right,Value) {
if !isobject(Tree)
Tree := object()
Tree[Node, "L"] := Left
Tree[Node, "R"] := Right
Tree[Node, "V"] := Value
}
PreOrder(Tree,Node) {
ptree := Tree[Node, "V"] " "
. ((L:=Tree[Node, "L"]) ? PreOrder(Tree,L) : "")
. ((R:=Tree[Node, "R"]) ? PreOrder(Tree,R) : "")
return ptree
}
InOrder(Tree,Node) {
Return itree := ((L:=Tree[Node, "L"]) ? InOrder(Tree,L) : "")
. Tree[Node, "V"] " "
. ((R:=Tree[Node, "R"]) ? InOrder(Tree,R) : "")
}
PostOrder(Tree,Node) {
Return ptree := ((L:=Tree[Node, "L"]) ? PostOrder(Tree,L) : "")
. ((R:=Tree[Node, "R"]) ? PostOrder(Tree,R) : "")
. Tree[Node, "V"] " "
}
LevOrder(Tree,Node,Lev=1) {
Static ; make node lists static
i%Lev% .= Tree[Node, "V"] " " ; build node lists in every level
If (L:=Tree[Node, "L"])
LevOrder(Tree,L,Lev+1)
If (R:=Tree[Node, "R"])
LevOrder(Tree,R,Lev+1)
If (Lev > 1)
Return
While i%Lev% ; concatenate node lists from all levels
t .= i%Lev%, Lev++
Return t
}
AWK
function preorder(tree, node, res, child) {
if (node == "")
return
res[res["count"]++] = node
split(tree[node], child, ",")
preorder(tree,child[1],res)
preorder(tree,child[2],res)
}
function inorder(tree, node, res, child) {
if (node == "")
return
split(tree[node], child, ",")
inorder(tree,child[1],res)
res[res["count"]++] = node
inorder(tree,child[2],res)
}
function postorder(tree, node, res, child) {
if (node == "")
return
split(tree[node], child, ",")
postorder(tree,child[1], res)
postorder(tree,child[2], res)
res[res["count"]++] = node
}
function levelorder(tree, node, res, nextnode, queue, child) {
if (node == "")
return
queue["tail"] = 0
queue[queue["head"]++] = node
while (queue["head"] - queue["tail"] >= 1) {
nextnode = queue[queue["tail"]]
delete queue[queue["tail"]++]
res[res["count"]++] = nextnode
split(tree[nextnode], child, ",")
if (child[1] != "")
queue[queue["head"]++] = child[1]
if (child[2] != "")
queue[queue["head"]++] = child[2]
}
delete queue
}
BEGIN {
tree["1"] = "2,3"
tree["2"] = "4,5"
tree["3"] = "6,"
tree["4"] = "7,"
tree["5"] = ","
tree["6"] = "8,9"
tree["7"] = ","
tree["8"] = ","
tree["9"] = ","
preorder(tree,"1",result)
printf "preorder:\t"
for (n = 0; n < result["count"]; n += 1)
printf result[n]" "
printf "\n"
delete result
inorder(tree,"1",result)
printf "inorder:\t"
for (n = 0; n < result["count"]; n += 1)
printf result[n]" "
printf "\n"
delete result
postorder(tree,"1",result)
printf "postorder:\t"
for (n = 0; n < result["count"]; n += 1)
printf result[n]" "
printf "\n"
delete result
levelorder(tree,"1",result)
printf "level-order:\t"
for (n = 0; n < result["count"]; n += 1)
printf result[n]" "
printf "\n"
delete result
}
Bracmat
(
( tree
= 1
. (2.(4.7.) (5.))
(3.6.(8.) (9.))
)
& ( preorder
= K sub
. !arg:(?K.?sub) ?arg
& !K preorder$!sub preorder$!arg
|
)
& out$("preorder: " preorder$!tree)
& ( inorder
= K lhs rhs
. !arg:(?K.?sub) ?arg
& ( !sub:%?lhs ?rhs
& inorder$!lhs !K inorder$!rhs inorder$!arg
| !K
)
)
& out$("inorder: " inorder$!tree)
& ( postorder
= K sub
. !arg:(?K.?sub) ?arg
& postorder$!sub !K postorder$!arg
|
)
& out$("postorder: " postorder$!tree)
& ( levelorder
= todo tree sub
. !arg:(.)&
| !arg:(?tree.?todo)
& ( !tree:(?K.?sub) ?tree
& !K levelorder$(!tree.!todo !sub)
| levelorder$(!todo.)
)
)
& out$("level-order:" levelorder$(!tree.))
&
)
BCPL
get "libhdr"
manifest $(
VAL=0
LEFT=1
RIGHT=2
$)
let tree(v,l,r) = valof
$( let obj = getvec(2)
obj!VAL := v
obj!LEFT := l
obj!RIGHT := r
resultis obj
$)
let preorder(tree, cb) be unless tree=0
$( cb(tree!VAL)
preorder(tree!LEFT, cb)
preorder(tree!RIGHT, cb)
$)
let inorder(tree, cb) be unless tree=0
$( inorder(tree!LEFT, cb)
cb(tree!VAL)
inorder(tree!RIGHT, cb)
$)
let postorder(tree, cb) be unless tree=0
$( postorder(tree!LEFT, cb)
postorder(tree!RIGHT, cb)
cb(tree!VAL)
$)
let levelorder(tree, cb) be
$( let q=vec 255
let s=0 and e=1
q!0 := tree
until s=e do
$( unless q!s=0 do
$( q!e := q!s!LEFT
q!(e+1) := q!s!RIGHT
e := e+2
cb(q!s!VAL)
$)
s := s+1
$)
$)
let traverse(name, order, tree) be
$( let cb(n) be writef("%N ", n)
writef("%S:*T", name)
order(tree, cb)
wrch('*N')
$)
let start() be
$( let example = tree(1, tree(2, tree(4, tree(7, 0, 0), 0),
tree(5, 0, 0)),
tree(3, tree(6, tree(8, 0, 0),
tree(9, 0, 0)),
0))
traverse("preorder", preorder, example)
traverse("inorder", inorder, example)
traverse("postorder", postorder, example)
traverse("level-order", levelorder, example)
$)
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
C
#include <stdlib.h>
#include <stdio.h>
typedef struct node_s
{
int value;
struct node_s* left;
struct node_s* right;
} *node;
node tree(int v, node l, node r)
{
node n = malloc(sizeof(struct node_s));
n->value = v;
n->left = l;
n->right = r;
return n;
}
void destroy_tree(node n)
{
if (n->left)
destroy_tree(n->left);
if (n->right)
destroy_tree(n->right);
free(n);
}
void preorder(node n, void (*f)(int))
{
f(n->value);
if (n->left)
preorder(n->left, f);
if (n->right)
preorder(n->right, f);
}
void inorder(node n, void (*f)(int))
{
if (n->left)
inorder(n->left, f);
f(n->value);
if (n->right)
inorder(n->right, f);
}
void postorder(node n, void (*f)(int))
{
if (n->left)
postorder(n->left, f);
if (n->right)
postorder(n->right, f);
f(n->value);
}
/* helper queue for levelorder */
typedef struct qnode_s
{
struct qnode_s* next;
node value;
} *qnode;
typedef struct { qnode begin, end; } queue;
void enqueue(queue* q, node n)
{
qnode node = malloc(sizeof(struct qnode_s));
node->value = n;
node->next = 0;
if (q->end)
q->end->next = node;
else
q->begin = node;
q->end = node;
}
node dequeue(queue* q)
{
node tmp = q->begin->value;
qnode second = q->begin->next;
free(q->begin);
q->begin = second;
if (!q->begin)
q->end = 0;
return tmp;
}
int queue_empty(queue* q)
{
return !q->begin;
}
void levelorder(node n, void(*f)(int))
{
queue nodequeue = {};
enqueue(&nodequeue, n);
while (!queue_empty(&nodequeue))
{
node next = dequeue(&nodequeue);
f(next->value);
if (next->left)
enqueue(&nodequeue, next->left);
if (next->right)
enqueue(&nodequeue, next->right);
}
}
void print(int n)
{
printf("%d ", n);
}
int main()
{
node n = tree(1,
tree(2,
tree(4,
tree(7, 0, 0),
0),
tree(5, 0, 0)),
tree(3,
tree(6,
tree(8, 0, 0),
tree(9, 0, 0)),
0));
printf("preorder: ");
preorder(n, print);
printf("\n");
printf("inorder: ");
inorder(n, print);
printf("\n");
printf("postorder: ");
postorder(n, print);
printf("\n");
printf("level-order: ");
levelorder(n, print);
printf("\n");
destroy_tree(n);
return 0;
}
C#
using System;
using System.Collections.Generic;
using System.Linq;
class Node
{
int Value;
Node Left;
Node Right;
Node(int value = default(int), Node left = default(Node), Node right = default(Node))
{
Value = value;
Left = left;
Right = right;
}
IEnumerable<int> Preorder()
{
yield return Value;
if (Left != null)
foreach (var value in Left.Preorder())
yield return value;
if (Right != null)
foreach (var value in Right.Preorder())
yield return value;
}
IEnumerable<int> Inorder()
{
if (Left != null)
foreach (var value in Left.Inorder())
yield return value;
yield return Value;
if (Right != null)
foreach (var value in Right.Inorder())
yield return value;
}
IEnumerable<int> Postorder()
{
if (Left != null)
foreach (var value in Left.Postorder())
yield return value;
if (Right != null)
foreach (var value in Right.Postorder())
yield return value;
yield return Value;
}
IEnumerable<int> LevelOrder()
{
var queue = new Queue<Node>();
queue.Enqueue(this);
while (queue.Any())
{
var node = queue.Dequeue();
yield return node.Value;
if (node.Left != null)
queue.Enqueue(node.Left);
if (node.Right != null)
queue.Enqueue(node.Right);
}
}
static void Main()
{
var tree = new Node(1, new Node(2, new Node(4, new Node(7)), new Node(5)), new Node(3, new Node(6, new Node(8), new Node(9))));
foreach (var traversal in new Func<IEnumerable<int>>[] { tree.Preorder, tree.Inorder, tree.Postorder, tree.LevelOrder })
Console.WriteLine("{0}:\t{1}", traversal.Method.Name, string.Join(" ", traversal()));
}
}
C++
Compiler: g++ (version 4.3.2 20081105 (Red Hat 4.3.2-7))
#include <boost/scoped_ptr.hpp>
#include <iostream>
#include <queue>
template<typename T>
class TreeNode {
public:
TreeNode(const T& n, TreeNode* left = NULL, TreeNode* right = NULL)
: mValue(n),
mLeft(left),
mRight(right) {}
T getValue() const {
return mValue;
}
TreeNode* left() const {
return mLeft.get();
}
TreeNode* right() const {
return mRight.get();
}
void preorderTraverse() const {
std::cout << " " << getValue();
if(mLeft) { mLeft->preorderTraverse(); }
if(mRight) { mRight->preorderTraverse(); }
}
void inorderTraverse() const {
if(mLeft) { mLeft->inorderTraverse(); }
std::cout << " " << getValue();
if(mRight) { mRight->inorderTraverse(); }
}
void postorderTraverse() const {
if(mLeft) { mLeft->postorderTraverse(); }
if(mRight) { mRight->postorderTraverse(); }
std::cout << " " << getValue();
}
void levelorderTraverse() const {
std::queue<const TreeNode*> q;
q.push(this);
while(!q.empty()) {
const TreeNode* n = q.front();
q.pop();
std::cout << " " << n->getValue();
if(n->left()) { q.push(n->left()); }
if(n->right()) { q.push(n->right()); }
}
}
protected:
T mValue;
boost::scoped_ptr<TreeNode> mLeft;
boost::scoped_ptr<TreeNode> mRight;
private:
TreeNode();
};
int main() {
TreeNode<int> root(1,
new TreeNode<int>(2,
new TreeNode<int>(4,
new TreeNode<int>(7)),
new TreeNode<int>(5)),
new TreeNode<int>(3,
new TreeNode<int>(6,
new TreeNode<int>(8),
new TreeNode<int>(9))));
std::cout << "preorder: ";
root.preorderTraverse();
std::cout << std::endl;
std::cout << "inorder: ";
root.inorderTraverse();
std::cout << std::endl;
std::cout << "postorder: ";
root.postorderTraverse();
std::cout << std::endl;
std::cout << "level-order:";
root.levelorderTraverse();
std::cout << std::endl;
return 0;
}
Array version
#include <iostream>
using namespace std;
const int MAX_DIM = 16;
typedef int* tree;
int left(int index)
{
return index*2+1;
}
int right(int index)
{
return index*2+2;
}
void preorder(tree t, int index = 0)
{
if(index < MAX_DIM && t[index] != 0){
cout << t[index] << ' ';
preorder(t, left(index));
preorder(t, right(index));
}
}
void inorder(tree t, int index = 0)
{
if(index < MAX_DIM && t[index] != 0){
inorder(t, left(index));
cout << t[index] << ' ';
inorder(t, right(index));
}
}
void postorder(tree t, int index = 0)
{
if(index < MAX_DIM && t[index] != 0){
postorder(t, left(index));
postorder(t, right(index));
cout << t[index] << ' ';
}
}
void level_order(tree t, int index = 0)
{
for(int i = 0; i < MAX_DIM; ++i){
if(t[i] != 0)
cout << t[i] << ' ';
}
}
int main()
{
int t[MAX_DIM] = {1,2,3,4,5,6,0,7,0,0,0,8,9};
cout << "preorder: ";
preorder(t);
cout << endl;
cout << "inorder: ";
inorder(t);
cout << endl;
cout << "postorder: ";
postorder(t);
cout << endl;
cout << "level_order: ";
level_order(t);
cout << endl;
}
Modern C++
#include <iostream>
#include <memory>
#include <queue>
template <typename T>
class node {
public:
node(T value) : value_(value) {}
node(T value, std::unique_ptr<node>&& left)
: value_(value), left_(std::move(left)) {}
node(T value, std::unique_ptr<node>&& left, std::unique_ptr<node>&& right)
: value_(value), left_(std::move(left)), right_(std::move(right)) {}
template <typename Function>
void pre_order(Function f) {
f(value_);
if (left_)
left_->pre_order(f);
if (right_)
right_->pre_order(f);
}
template <typename Function>
void in_order(Function f) {
if (left_)
left_->in_order(f);
f(value_);
if (right_)
right_->in_order(f);
}
template <typename Function>
void post_order(Function f) {
if (left_)
left_->post_order(f);
if (right_)
right_->post_order(f);
f(value_);
}
template <typename Function>
void level_order(Function f) {
std::queue<node*> queue;
queue.push(this);
while (!queue.empty()) {
node* next = queue.front();
queue.pop();
f(next->value_);
if (next->left_)
queue.push(next->left_.get());
if (next->right_)
queue.push(next->right_.get());
}
}
private:
T value_;
std::unique_ptr<node> left_;
std::unique_ptr<node> right_;
};
template <typename T, typename... Args>
std::unique_ptr<node<T>>
tree(T value, Args&&... args) {
return std::make_unique<node<T>>(value, std::forward<Args>(args)...);
}
int main() {
node<int> n(1,
tree(2,
tree(4,
tree(7)),
tree(5)),
tree(3,
tree(6,
tree(8),
tree(9))));
auto print = [](int n) { std::cout << n << ' '; };
std::cout << "pre-order: ";
n.pre_order(print);
std::cout << '\n';
std::cout << "in-order: ";
n.in_order(print);
std::cout << '\n';
std::cout << "post-order: ";
n.post_order(print);
std::cout << '\n';
std::cout << "level-order: ";
n.level_order(print);
std::cout << '\n';
}
- Output:
pre-order: 1 2 4 7 5 3 6 8 9 in-order: 7 4 2 5 1 8 6 9 3 post-order: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
Ceylon
import ceylon.collection {
ArrayList
}
shared void run() {
class Node(label, left = null, right = null) {
shared Integer label;
shared Node? left;
shared Node? right;
string => label.string;
}
void preorder(Node node) {
process.write(node.string + " ");
if(exists left = node.left) {
preorder(left);
}
if(exists right = node.right) {
preorder(right);
}
}
void inorder(Node node) {
if(exists left = node.left) {
inorder(left);
}
process.write(node.string + " ");
if(exists right = node.right) {
inorder(right);
}
}
void postorder(Node node) {
if(exists left = node.left) {
postorder(left);
}
if(exists right = node.right) {
postorder(right);
}
process.write(node.string + " ");
}
void levelOrder(Node node) {
value nodes = ArrayList<Node> {node};
while(exists current = nodes.accept()) {
process.write(current.string + " ");
if(exists left = current.left) {
nodes.offer(left);
}
if(exists right = current.right) {
nodes.offer(right);
}
}
}
value tree = Node {
label = 1;
left = Node {
label = 2;
left = Node {
label = 4;
left = Node {
label = 7;
};
};
right = Node {
label = 5;
};
};
right = Node {
label = 3;
left = Node {
label = 6;
left = Node {
label = 8;
};
right = Node {
label = 9;
};
};
};
};
process.write("preorder: ");
preorder(tree);
print("");
process.write("inorder: ");
inorder(tree);
print("");
process.write("postorder: ");
postorder(tree);
print("");
process.write("levelorder: ");
levelOrder(tree);
print("");
}
Clojure
(defn walk [node f order]
(when node
(doseq [o order]
(if (= o :visit)
(f (:val node))
(walk (node o) f order)))))
(defn preorder [node f]
(walk node f [:visit :left :right]))
(defn inorder [node f]
(walk node f [:left :visit :right]))
(defn postorder [node f]
(walk node f [:left :right :visit]))
(defn queue [& xs]
(when (seq xs)
(apply conj clojure.lang.PersistentQueue/EMPTY xs)))
(defn level-order [root f]
(loop [q (queue root)]
(when-not (empty? q)
(if-let [node (first q)]
(do
(f (:val node))
(recur (conj (pop q) (:left node) (:right node))))
(recur (pop q))))))
(defn vec-to-tree [t]
(if (vector? t)
(let [[val left right] t]
{:val val
:left (vec-to-tree left)
:right (vec-to-tree right)})
t))
(let [tree (vec-to-tree [1 [2 [4 [7]] [5]] [3 [6 [8] [9]]]])
fs '[preorder inorder postorder level-order]
pr-node #(print (format "%2d" %))]
(doseq [f fs]
(print (format "%-12s" (str f ":")))
((resolve f) tree pr-node)
(println)))
CLU
bintree = cluster [T: type] is leaf, node,
pre_order, post_order, in_order, level_order
branch = struct[left, right: bintree[T], val: T]
rep = oneof[br: branch, leaf: null]
leaf = proc () returns (cvt)
return(rep$make_leaf(nil))
end leaf
node = proc (val: T, l,r: cvt) returns (cvt)
return(rep$make_br(branch${left:up(l), right:up(r), val:val}))
end node
pre_order = iter (n: cvt) yields (T)
tagcase n
tag br (b: branch):
yield(b.val)
for v: T in pre_order(b.left) do yield(v) end
for v: T in pre_order(b.right) do yield(v) end
tag leaf:
end
end pre_order
in_order = iter (n: cvt) yields (T)
tagcase n
tag br (b: branch):
for v: T in in_order(b.left) do yield(v) end
yield(b.val)
for v: T in in_order(b.right) do yield(v) end
tag leaf:
end
end in_order
post_order = iter (n: cvt) yields (T)
tagcase n
tag br (b: branch):
for v: T in post_order(b.left) do yield(v) end
for v: T in post_order(b.right) do yield(v) end
yield(b.val)
tag leaf:
end
end post_order
level_order = iter (n: cvt) yields (T)
bfs: array[rep] := array[rep]$[n]
while ~array[rep]$empty(bfs) do
cur: rep := array[rep]$reml(bfs)
tagcase cur
tag br (b: branch):
yield(b.val)
array[rep]$addh(bfs,down(b.left))
array[rep]$addh(bfs,down(b.right))
tag leaf:
end
end
end level_order
end bintree
start_up = proc ()
bt = bintree[int]
po: stream := stream$primary_output()
tree: bt := bt$node(1,
bt$node(2,
bt$node(4,
bt$node(7, bt$leaf(), bt$leaf()),
bt$leaf()),
bt$node(5, bt$leaf(), bt$leaf())),
bt$node(3,
bt$node(6,
bt$node(8, bt$leaf(), bt$leaf()),
bt$node(9, bt$leaf(), bt$leaf())),
bt$leaf()))
stream$puts(po, "preorder: ")
for i: int in bt$pre_order(tree) do
stream$puts(po, " " || int$unparse(i))
end
stream$puts(po, "\ninorder: ")
for i: int in bt$in_order(tree) do
stream$puts(po, " " || int$unparse(i))
end
stream$puts(po, "\npostorder: ")
for i: int in bt$post_order(tree) do
stream$puts(po, " " || int$unparse(i))
end
stream$puts(po, "\nlevel-order:")
for i: int in bt$level_order(tree) do
stream$puts(po, " " || int$unparse(i))
end
end start_up
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
CoffeeScript
# In this example, we don't encapsulate binary trees as objects; instead, we have a
# convention on how to store them as arrays, and we namespace the functions that
# operate on those data structures.
binary_tree =
preorder: (tree, visit) ->
return unless tree?
[node, left, right] = tree
visit node
binary_tree.preorder left, visit
binary_tree.preorder right, visit
inorder: (tree, visit) ->
return unless tree?
[node, left, right] = tree
binary_tree.inorder left, visit
visit node
binary_tree.inorder right, visit
postorder: (tree, visit) ->
return unless tree?
[node, left, right] = tree
binary_tree.postorder left, visit
binary_tree.postorder right, visit
visit node
levelorder: (tree, visit) ->
q = []
q.push tree
while q.length > 0
t = q.shift()
continue unless t?
[node, left, right] = t
visit node
q.push left
q.push right
do ->
tree = [1, [2, [4, [7]], [5]], [3, [6, [8],[9]]]]
test_walk = (walk_function_name) ->
output = []
binary_tree[walk_function_name] tree, output.push.bind(output)
console.log walk_function_name, output.join ' '
test_walk "preorder"
test_walk "inorder"
test_walk "postorder"
test_walk "levelorder"
output
> coffee tree_traversal.coffee preorder 1 2 4 7 5 3 6 8 9 inorder 7 4 2 5 1 8 6 9 3 postorder 7 4 5 2 8 9 6 3 1 levelorder 1 2 3 4 5 6 7 8 9
Common Lisp
(defun preorder (node f)
(when node
(funcall f (first node))
(preorder (second node) f)
(preorder (third node) f)))
(defun inorder (node f)
(when node
(inorder (second node) f)
(funcall f (first node))
(inorder (third node) f)))
(defun postorder (node f)
(when node
(postorder (second node) f)
(postorder (third node) f)
(funcall f (first node))))
(defun level-order (node f)
(loop with level = (list node)
while level
do
(setf level (loop for node in level
when node
do (funcall f (first node))
and collect (second node)
and collect (third node)))))
(defparameter *tree* '(1 (2 (4 (7))
(5))
(3 (6 (8)
(9)))))
(defun show (traversal-function)
(format t "~&~(~A~):~12,0T" traversal-function)
(funcall traversal-function *tree* (lambda (value) (format t " ~A" value))))
(map nil #'show '(preorder inorder postorder level-order))
Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 2 5 1 8 6 9 3 level-order: 1 2 3 4 5 6 7 8 9
Coq
Require Import Utf8.
Require Import List.
Unset Elimination Schemes.
(* Rose tree, with numbers on nodes *)
Inductive tree := Tree { value : nat ; children : list tree }.
Fixpoint height (t: tree) : nat :=
1 + fold_left (? n t, max n (height t)) (children t) 0.
Example leaf n : tree := {| value := n ; children := nil |}.
Example t2 : tree := {| value := 2 ; children := {| value := 4 ; children := leaf 7 :: nil |} :: leaf 5 :: nil |}.
Example t3 : tree := {| value := 3 ; children := {| value := 6 ; children := leaf 8 :: leaf 9 :: nil |} :: nil |}.
Example t9 : tree := {| value := 1 ; children := t2 :: t3 :: nil |}.
Fixpoint preorder (t: tree) : list nat :=
let '{| value := n ; children := c |} := t in
n :: flat_map preorder c.
Fixpoint inorder (t: tree) : list nat :=
let '{| value := n ; children := c |} := t in
match c with
| nil => n :: nil
| l :: r => inorder l ++ n :: flat_map inorder r
end.
Fixpoint postorder (t: tree) : list nat :=
let '{| value := n ; children := c |} := t in
flat_map postorder c ++ n :: nil.
(* Auxiliary function for levelorder, which operates on forests *)
(* Since the recursion is tricky, it relies on a fuel parameter which obviously decreases. *)
Fixpoint levelorder_forest (fuel: nat) (f: list tree) : list nat:=
match fuel with
| O => nil
| S fuel' =>
let '(p, f) := fold_right (? t r, let '(x, f) := r in (value t :: x, children t ++ f) ) (nil, nil) f in
p ++ levelorder_forest fuel' f
end.
Definition levelorder (t: tree) : list nat :=
levelorder_forest (height t) (t :: nil).
Compute preorder t9.
Compute inorder t9.
Compute postorder t9.
Compute levelorder t9.
Crystal
class Node(T)
property left : Nil | Node(T)
property right : Nil | Node(T)
property data : T
def initialize(@data, @left = nil, @right = nil)
end
def preorder_traverse
print " #{data}"
if left = @left
left.preorder_traverse
end
if right = @right
right.preorder_traverse
end
end
def inorder_traverse
if left = @left
left.inorder_traverse
end
print " #{data}"
if right = @right
right.inorder_traverse
end
end
def postorder_traverse
if left = @left
left.postorder_traverse
end
if right = @right
right.postorder_traverse
end
print " #{data}"
end
def levelorder_traverse
queue = Array(Node(T)).new
queue << self
until queue.size <= 0
node = queue.shift
unless node
next
end
print " #{node.data}"
if left = node.left
queue << left
end
if right = node.right
queue << right
end
end
end
end
tree = Node(Int32).new(1,
Node(Int32).new(2,
Node(Int32).new(4,
Node(Int32).new(7)),
Node(Int32).new(5)),
Node(Int32).new(3,
Node(Int32).new(6,
Node(Int32).new(8),
Node(Int32).new(9))))
print "preorder: "
tree.preorder_traverse
print "\ninorder: "
tree.inorder_traverse
print "\npostorder: "
tree.postorder_traverse
print "\nlevelorder: "
tree.levelorder_traverse
puts
Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 levelorder: 1 2 3 4 5 6 7 8 9
D
This code is long because it's very generic.
import std.stdio, std.traits;
const final class Node(T) {
T data;
Node left, right;
this(in T data, in Node left=null, in Node right=null)
const pure nothrow {
this.data = data;
this.left = left;
this.right = right;
}
}
// 'static' templated opCall can't be used in Node
auto node(T)(in T data, in Node!T left=null, in Node!T right=null)
pure nothrow {
return new const(Node!T)(data, left, right);
}
void show(T)(in T x) {
write(x, " ");
}
enum Visit { pre, inv, post }
// 'visitor' can be any kind of callable or it uses a default visitor.
// TNode can be any kind of Node, with data, left and right fields,
// so this is more generic than a member function of Node.
void backtrackingOrder(Visit v, TNode, TyF=void*)
(in TNode node, TyF visitor=null) {
alias trueVisitor = Select!(is(TyF == void*), show, visitor);
if (node !is null) {
static if (v == Visit.pre)
trueVisitor(node.data);
backtrackingOrder!v(node.left, visitor);
static if (v == Visit.inv)
trueVisitor(node.data);
backtrackingOrder!v(node.right, visitor);
static if (v == Visit.post)
trueVisitor(node.data);
}
}
void levelOrder(TNode, TyF=void*)
(in TNode node, TyF visitor=null, const(TNode)[] more=[]) {
alias trueVisitor = Select!(is(TyF == void*), show, visitor);
if (node !is null) {
more ~= [node.left, node.right];
trueVisitor(node.data);
}
if (more.length)
levelOrder(more[0], visitor, more[1 .. $]);
}
void main() {
alias N = node;
const tree = N(1,
N(2,
N(4,
N(7)),
N(5)),
N(3,
N(6,
N(8),
N(9))));
write(" preOrder: ");
tree.backtrackingOrder!(Visit.pre);
write("\n inorder: ");
tree.backtrackingOrder!(Visit.inv);
write("\n postOrder: ");
tree.backtrackingOrder!(Visit.post);
write("\nlevelorder: ");
tree.levelOrder;
writeln;
}
- Output:
preOrder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postOrder: 7 4 5 2 8 9 6 3 1 levelorder: 1 2 3 4 5 6 7 8 9
Alternative Version
Generic as the first version, but not lazy as the Haskell version.
const struct Node(T) {
T v;
Node* l, r;
}
T[] preOrder(T)(in Node!T* t) pure nothrow {
return t ? t.v ~ preOrder(t.l) ~ preOrder(t.r) : [];
}
T[] inOrder(T)(in Node!T* t) pure nothrow {
return t ? inOrder(t.l) ~ t.v ~ inOrder(t.r) : [];
}
T[] postOrder(T)(in Node!T* t) pure nothrow {
return t ? postOrder(t.l) ~ postOrder(t.r) ~ t.v : [];
}
T[] levelOrder(T)(in Node!T* t) pure nothrow {
static T[] loop(in Node!T*[] a) pure nothrow {
if (!a.length) return [];
if (!a[0]) return loop(a[1 .. $]);
return a[0].v ~ loop(a[1 .. $] ~ [a[0].l, a[0].r]);
}
return loop([t]);
}
void main() {
alias N = Node!int;
auto tree = new N(1,
new N(2,
new N(4,
new N(7)),
new N(5)),
new N(3,
new N(6,
new N(8),
new N(9))));
import std.stdio;
writeln(preOrder(tree));
writeln(inOrder(tree));
writeln(postOrder(tree));
writeln(levelOrder(tree));
}
- Output:
[1, 2, 4, 7, 5, 3, 6, 8, 9] [7, 4, 2, 5, 1, 8, 6, 9, 3] [7, 4, 5, 2, 8, 9, 6, 3, 1] [1, 2, 3, 4, 5, 6, 7, 8, 9]
Alternative Lazy Version
This version is not complete, it lacks the level order visit.
import std.stdio, std.algorithm, std.range, std.string;
const struct Tree(T) {
T value;
Tree* left, right;
}
alias VisitRange(T) = InputRange!(const Tree!T);
VisitRange!T preOrder(T)(in Tree!T* t) /*pure nothrow*/ {
enum self = mixin("&" ~ __FUNCTION__.split(".").back);
if (t == null)
return typeof(return).init.takeNone.inputRangeObject;
return [*t]
.chain([t.left, t.right]
.filter!(t => t != null)
.map!(a => self(a))
.joiner)
.inputRangeObject;
}
VisitRange!T inOrder(T)(in Tree!T* t) /*pure nothrow*/ {
enum self = mixin("&" ~ __FUNCTION__.split(".").back);
if (t == null)
return typeof(return).init.takeNone.inputRangeObject;
return [t.left]
.filter!(t => t != null)
.map!(a => self(a))
.joiner
.chain([*t])
.chain([t.right]
.filter!(t => t != null)
.map!(a => self(a))
.joiner)
.inputRangeObject;
}
VisitRange!T postOrder(T)(in Tree!T* t) /*pure nothrow*/ {
enum self = mixin("&" ~ __FUNCTION__.split(".").back);
if (t == null)
return typeof(return).init.takeNone.inputRangeObject;
return [t.left, t.right]
.filter!(t => t != null)
.map!(a => self(a))
.joiner
.chain([*t])
.inputRangeObject;
}
void main() {
alias N = Tree!int;
const tree = new N(1,
new N(2,
new N(4,
new N(7)),
new N(5)),
new N(3,
new N(6,
new N(8),
new N(9))));
tree.preOrder.map!(t => t.value).writeln;
tree.inOrder.map!(t => t.value).writeln;
tree.postOrder.map!(t => t.value).writeln;
}
- Output:
[1, 2, 4, 7, 5, 3, 6, 8, 9] [7, 4, 2, 5, 1, 8, 6, 9, 3] [7, 4, 5, 2, 8, 9, 6, 3, 1]
Delphi
{Structure holding node data}
type PNode = ^TNode;
TNode = record
Data: integer;
Left,Right: PNode;
end;
function PreOrder(Node: TNode): string;
{Recursively traverse Node-Left-Right}
begin
Result:=IntToStr(Node.Data);
if Node.Left<>nil then Result:=Result+' '+PreOrder(Node.Left^);
if Node.Right<>nil then Result:=Result+' '+PreOrder(Node.Right^);
end;
function InOrder(Node: TNode): string;
{Recursively traverse Left-Node-Right}
begin
Result:='';
if Node.Left<>nil then Result:=Result+inOrder(Node.Left^);
Result:=Result+IntToStr(Node.Data)+' ';
if Node.Right<>nil then Result:=Result+inOrder(Node.Right^);
end;
function PostOrder(Node: TNode): string;
{Recursively traverse Left-Right-Node}
begin
Result:='';
if Node.Left<>nil then Result:=Result+PostOrder(Node.Left^);
if Node.Right<>nil then Result:=Result+PostOrder(Node.Right^);
Result:=Result+IntToStr(Node.Data)+' ';
end;
function LevelOrder(Node: TNode): string;
{Traverse the tree at each level, Left to right}
var Queue: TList;
var NT: TNode;
begin
Queue:=TList.Create;
try
Result:='';
Queue.Add(@Node);
while true do
begin
{Display oldest node in queue}
NT:=PNode(Queue[0])^;
Queue.Delete(0);
Result:=Result+IntToStr(NT.Data)+' ';
{Queue left and right children}
if NT.left<>nil then Queue.add(NT.left);
if NT.right<>nil then Queue.add(NT.right);
if Queue.Count<1 then break;
end;
finally Queue.Free; end;
end;
procedure ShowBinaryTree(Memo: TMemo);
var Tree: array [0..9] of TNode;
var I: integer;
begin
{Fill array of node with data}
{that matchs its position in the array}
for I:=0 to High(Tree) do
begin
Tree[I].Data:=I+1;
Tree[I].Left:=nil;
Tree[I].Right:=nil;
end;
{Build the specified tree}
Tree[0].left:=@Tree[2-1];
Tree[0].right:=@Tree[3-1];
Tree[1].left:=@Tree[4-1];
Tree[1].right:=@Tree[5-1];
Tree[3].left:=@Tree[7-1];
Tree[2].left:=@Tree[6-1];
Tree[5].left:=@Tree[8-1];
Tree[5].right:=@Tree[9-1];
{Tranverse the tree in four specified ways}
Memo.Lines.Add('Pre-Order: '+PreOrder(Tree[0]));
Memo.Lines.Add('In-Order: '+InOrder(Tree[0]));
Memo.Lines.Add('Post-Order: '+PostOrder(Tree[0]));
Memo.Lines.Add('Level-Order: '+LevelOrder(Tree[0]));
end;
- Output:
Pre-Order: 1 2 4 7 5 3 6 8 9 In-Order: 7 4 2 5 1 8 6 9 3 Post-Order: 7 4 5 2 8 9 6 3 1 Level-Order: 1 2 3 4 5 6 7 8 9 Elapsed Time: 4.897 ms.
Draco
type
Node = struct {
int val;
*Node left, right;
},
Tree = *Node;
proc tree(int v; Tree l, r) Tree:
Tree t;
t := new(Node);
t*.val := v;
t*.left := l;
t*.right := r;
t
corp
proc preorder(Tree t) void:
if t /= nil then
write(t*.val, ' ');
preorder(t*.left);
preorder(t*.right)
fi
corp
proc inorder(Tree t) void:
if t /= nil then
inorder(t*.left);
write(t*.val, ' ');
inorder(t*.right)
fi
corp
proc postorder(Tree t) void:
if t /= nil then
postorder(t*.left);
postorder(t*.right);
write(t*.val, ' ')
fi
corp
proc levelorder(Tree t) void:
[256]Tree q;
word s, e;
s := 0;
q[s] := t;
e := 1;
while s /= e do
if q[s] /= nil then
q[e] := q[s]*.left;
q[e+1] := q[s]*.right;
e := e+2;
write(q[s]*.val, ' ')
fi;
s := s+1
od
corp
proc main() void:
Tree t;
t := tree(1,
tree(2,
tree(4,
tree(7,nil,nil),
nil),
tree(5,nil,nil)),
tree(3,
tree(6,
tree(8,nil,nil),
tree(9,nil,nil)),
nil));
write("preorder: "); preorder(t); writeln();
write("inorder: "); inorder(t); writeln();
write("postorder: "); postorder(t); writeln();
write("level-order: "); levelorder(t); writeln();
corp
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
E
def btree := [1, [2, [4, [7, null, null],
null],
[5, null, null]],
[3, [6, [8, null, null],
[9, null, null]],
null]]
def backtrackingOrder(node, pre, mid, post) {
switch (node) {
match ==null {}
match [value, left, right] {
pre(value)
backtrackingOrder(left, pre, mid, post)
mid(value)
backtrackingOrder(right, pre, mid, post)
post(value)
}
}
}
def levelOrder(root, func) {
var level := [root].diverge()
while (level.size() > 0) {
for node in level.removeRun(0) {
switch (node) {
match ==null {}
match [value, left, right] {
func(value)
level.push(left)
level.push(right)
} } } } }
print("preorder: ")
backtrackingOrder(btree, fn v { print(" ", v) }, fn _ {}, fn _ {})
println()
print("inorder: ")
backtrackingOrder(btree, fn _ {}, fn v { print(" ", v) }, fn _ {})
println()
print("postorder: ")
backtrackingOrder(btree, fn _ {}, fn _ {}, fn v { print(" ", v) })
println()
print("level-order:")
levelOrder(btree, fn v { print(" ", v) })
println()
EasyLang
tree[] = [ 1 2 3 4 5 6 -1 7 -1 -1 -1 8 9 ]
#
proc preorder ind . .
if ind > len tree[] or tree[ind] = -1
return
.
write " " & tree[ind]
preorder ind * 2
preorder ind * 2 + 1
.
write "preorder:"
preorder 1
print ""
#
proc inorder ind . .
if ind > len tree[] or tree[ind] = -1
return
.
inorder ind * 2
write " " & tree[ind]
inorder ind * 2 + 1
.
write "inorder:"
inorder 1
print ""
#
proc postorder ind . .
if ind > len tree[] or tree[ind] = -1
return
.
postorder ind * 2
postorder ind * 2 + 1
write " " & tree[ind]
.
write "postorder:"
postorder 1
print ""
#
global tail head queue[] .
proc initqu n . .
len queue[] n
tail = 1
head = 1
.
proc enqu v . .
queue[tail] = v
tail = (tail + 1) mod1 len queue[]
.
func dequ .
if head = tail
return -1
.
h = head
head = (head + 1) mod1 len queue[]
return queue[h]
.
initqu len tree[]
proc levelorder n . .
enqu n
repeat
ind = dequ
until ind = -1
if ind < len tree[] and tree[ind] <> -1
write " " & tree[ind]
enqu ind * 2
enqu ind * 2 + 1
.
.
.
write "level-order:"
levelorder 1
print ""
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8
Eiffel
Void-Safety has been disabled for simplicity of the code.
note
description : "Application for tree traversal demonstration"
output : "[
Prints preorder, inorder, postorder and levelorder traversal of an example binary tree.
]"
author : "Jascha Grübel"
date : "$2014-01-07$"
revision : "$1.0$"
class
APPLICATION
create
make
feature {NONE} -- Initialization
make
-- Run Tree traversal example.
local
tree:NODE
do
create tree.make (1)
tree.set_left_child (create {NODE}.make (2))
tree.set_right_child (create {NODE}.make (3))
tree.left_child.set_left_child (create {NODE}.make (4))
tree.left_child.set_right_child (create {NODE}.make (5))
tree.left_child.left_child.set_left_child (create {NODE}.make (7))
tree.right_child.set_left_child (create {NODE}.make (6))
tree.right_child.left_child.set_left_child (create {NODE}.make (8))
tree.right_child.left_child.set_right_child (create {NODE}.make (9))
Io.put_string ("preorder: ")
tree.print_preorder
Io.put_new_line
Io.put_string ("inorder: ")
tree.print_inorder
Io.put_new_line
Io.put_string ("postorder: ")
tree.print_postorder
Io.put_new_line
Io.put_string ("level-order:")
tree.print_levelorder
Io.put_new_line
end
end -- class APPLICATION
note
description : "A simple node for a binary tree"
libraries : "Relies on LINKED_LIST from EiffelBase"
author : "Jascha Grübel"
date : "$2014-01-07$"
revision : "$1.0$"
implementation : "[
All traversals but the levelorder traversal have been implemented recursively.
The levelorder traversal is solved iteratively.
]"
class
NODE
create
make
feature {NONE} -- Initialization
make (a_value:INTEGER)
-- Creates a node with no children.
do
value := a_value
set_right_child(Void)
set_left_child(Void)
end
feature -- Modification
set_right_child (a_node:NODE)
-- Sets `right_child' to `a_node'.
do
right_child:=a_node
end
set_left_child (a_node:NODE)
-- Sets `left_child' to `a_node'.
do
left_child:=a_node
end
feature -- Representation
print_preorder
-- Recursively prints the value of the node and all its children in preorder
do
Io.put_string (" " + value.out)
if has_left_child then
left_child.print_preorder
end
if has_right_child then
right_child.print_preorder
end
end
print_inorder
-- Recursively prints the value of the node and all its children in inorder
do
if has_left_child then
left_child.print_inorder
end
Io.put_string (" " + value.out)
if has_right_child then
right_child.print_inorder
end
end
print_postorder
-- Recursively prints the value of the node and all its children in postorder
do
if has_left_child then
left_child.print_postorder
end
if has_right_child then
right_child.print_postorder
end
Io.put_string (" " + value.out)
end
print_levelorder
-- Iteratively prints the value of the node and all its children in levelorder
local
l_linked_list:LINKED_LIST[NODE]
l_node:NODE
do
from
create l_linked_list.make
l_linked_list.extend (Current)
until
l_linked_list.is_empty
loop
l_node := l_linked_list.first
if l_node.has_left_child then
l_linked_list.extend (l_node.left_child)
end
if l_node.has_right_child then
l_linked_list.extend (l_node.right_child)
end
Io.put_string (" " + l_node.value.out)
l_linked_list.prune (l_node)
end
end
feature -- Access
value:INTEGER
-- Value stored in the node.
right_child:NODE
-- Reference to right child, possibly void.
left_child:NODE
-- Reference to left child, possibly void.
has_right_child:BOOLEAN
-- Test right child for existence.
do
Result := right_child /= Void
end
has_left_child:BOOLEAN
-- Test left child for existence.
do
Result := left_child /= Void
end
end
-- class NODE
Elena
ELENA 6.x :
import extensions;
import extensions'routines;
import system'collections;
singleton DummyNode
{
get generic()
= EmptyEnumerable;
}
class Node
{
int Value : rprop;
Node Left : rprop;
Node Right : rprop;
constructor new(int value)
{
Value := value
}
constructor new(int value, Node left)
{
Value := value;
Left := left;
}
constructor new(int value, Node left, Node right)
{
Value := value;
Left := left;
Right := right
}
Preorder = new Enumerable
{
Enumerator enumerator() = CompoundEnumerator.new(
SingleEnumerable.new(Value),
(Left ?? DummyNode).Preorder,
(Right ?? DummyNode).Preorder);
};
Inorder = new Enumerable
{
Enumerator enumerator()
{
if (nil != Left)
{
^ CompoundEnumerator.new(Left.Inorder, SingleEnumerable.new(Value), (Right ?? DummyNode).Inorder)
}
else
{
^ SingleEnumerable.new(Value).enumerator()
}
}
};
Postorder = new Enumerable
{
Enumerator enumerator()
{
if (nil == Left)
{
^ SingleEnumerable.new(Value).enumerator()
}
else if (nil == Right)
{
^ CompoundEnumerator.new(Left.Postorder, SingleEnumerable.new(Value))
}
else
{
^ CompoundEnumerator.new(Left.Postorder, Right.Postorder, SingleEnumerable.new(Value))
}
}
};
LevelOrder = new Enumerable
{
Queue<Node> queue := class Queue<Node>.allocate(4).push(self);
Enumerator enumerator() = new Enumerator
{
bool next() = queue.isNotEmpty();
get Value()
{
Node item := queue.pop();
Node left := item.Left;
Node right := item.Right;
if (nil != left)
{
queue.push(left)
};
if (nil != right)
{
queue.push(right)
};
^ item.Value
}
reset()
{
NotSupportedException.raise()
}
enumerable() = queue;
};
};
}
public program()
{
var tree := Node.new(1, Node.new(2, Node.new(4, Node.new(7)), Node.new(5)), Node.new(3, Node.new(6, Node.new(8), Node.new(9))));
console.printLine("Preorder :", tree.Preorder);
console.printLine("Inorder :", tree.Inorder);
console.printLine("Postorder :", tree.Postorder);
console.printLine("LevelOrder:", tree.LevelOrder)
}
- Output:
Preorder :1,2,4,7,5,3,6,8,9 Inorder :7,4,2,5,1,8,6,9,3 Postorder :7,4,5,2,8,9,6,3,1 LevelOrder:1,2,3,4,5,6,7,8,9
Elisa
This is a generic component for binary tree traversals. More information about binary trees in Elisa are given in trees.
component BinaryTreeTraversals (Tree, Element);
type Tree;
type Node = Tree;
Tree (LeftTree = Tree, Element, RightTree = Tree) -> Tree;
Leaf (Element) -> Node;
Node (Tree) -> Node;
Item (Node) -> Element;
Preorder (Tree) -> multi (Node);
Inorder (Tree) -> multi (Node);
Postorder (Tree) -> multi (Node);
Level_order(Tree) -> multi (Node);
begin
Tree (Lefttree, Item, Righttree) = Tree: [ Lefttree; Item; Righttree ];
Leaf (anItem) = Tree (null(Tree), anItem, null(Tree) );
Node (aTree) = aTree;
Item (aNode) = aNode.Item;
Preorder (=null(Tree)) = no(Tree);
Preorder (T) = ( T, Preorder (T.Lefttree), Preorder (T.Righttree));
Inorder (=null(Tree)) = no(Tree);
Inorder (T) = ( Inorder (T.Lefttree), T, Inorder (T.Righttree));
Postorder (=null(Tree)) = no(Tree);
Postorder (T) = ( Postorder (T.Lefttree), Postorder (T.Righttree), T);
Level_order(T) = [ Queue = {T};
node = Tree:items(Queue);
[ result(node);
add(Queue, node.Lefttree) when valid(node.Lefttree);
add(Queue, node.Righttree) when valid(node.Righttree);
];
no(Tree);
];
end component BinaryTreeTraversals;
Tests
use BinaryTreeTraversals (Tree, integer);
BT = Tree(
Tree(
Tree(Leaf(7), 4, null(Tree)), 2 , Leaf(5)), 1,
Tree(
Tree(Leaf(8), 6, Leaf(9)), 3 ,null(Tree)));
{Item(Preorder(BT))}?
{ 1, 2, 4, 7, 5, 3, 6, 8, 9}
{Item(Inorder(BT))}?
{ 7, 4, 2, 5, 1, 8, 6, 9, 3}
{Item(Postorder(BT))}?
{ 7, 4, 5, 2, 8, 9, 6, 3, 1}
{Item(Level_order(BT))}?
{ 1, 2, 3, 4, 5, 6, 7, 8, 9}
Elixir
defmodule Tree_Traversal do
defp tnode, do: {}
defp tnode(v), do: {:node, v, {}, {}}
defp tnode(v,l,r), do: {:node, v, l, r}
defp preorder(_,{}), do: :ok
defp preorder(f,{:node,v,l,r}) do
f.(v)
preorder(f,l)
preorder(f,r)
end
defp inorder(_,{}), do: :ok
defp inorder(f,{:node,v,l,r}) do
inorder(f,l)
f.(v)
inorder(f,r)
end
defp postorder(_,{}), do: :ok
defp postorder(f,{:node,v,l,r}) do
postorder(f,l)
postorder(f,r)
f.(v)
end
defp levelorder(_, []), do: []
defp levelorder(f, [{}|t]), do: levelorder(f, t)
defp levelorder(f, [{:node,v,l,r}|t]) do
f.(v)
levelorder(f, t++[l,r])
end
defp levelorder(f, x), do: levelorder(f, [x])
def main do
tree = tnode(1,
tnode(2,
tnode(4, tnode(7), tnode()),
tnode(5, tnode(), tnode())),
tnode(3,
tnode(6, tnode(8), tnode(9)),
tnode()))
f = fn x -> IO.write "#{x} " end
IO.write "preorder: "
preorder(f, tree)
IO.write "\ninorder: "
inorder(f, tree)
IO.write "\npostorder: "
postorder(f, tree)
IO.write "\nlevelorder: "
levelorder(f, tree)
IO.puts ""
end
end
Tree_Traversal.main
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 levelorder: 1 2 3 4 5 6 7 8 9
EMal
type Node
model
:T value
Node left
Node right
new by generic T, :T ←value do end
fun visit ← <|write(me.value + " ")
end
type Order
enum
int PREORDER, INORDER, POSTORDER, LEVELORDER
end
type Main
fun traverse ← void by Node node, Order order
if node æ null do return end
if order æ Order.PREORDER
node.visit()
traverse(node.left, order)
traverse(node.right, order)
else if order æ Order.INORDER
traverse(node.left, order)
node.visit()
traverse(node.right, order)
else if order æ Order.POSTORDER
traverse(node.left, order)
traverse(node.right, order)
node.visit()
else if order æ Order.LEVELORDER
List queue ← Node[]
queue.insertFirst(node)
while not queue.isEmpty()
Node next ← queue.deleteLast()
next.visit()
if next.left ≠ null do queue.insertFirst(next.left) end
if next.right ≠ null do queue.insertFirst(next.right) end
end
end
end
Node one ← Node(int, 1)
Node two ← Node(int, 2)
Node three ← Node(int, 3)
Node four ← Node(int, 4)
Node five ← Node(int, 5)
Node six ← Node(int, 6)
Node seven ← Node(int, 7)
Node eight ← Node(int, 8)
Node nine ← Node(int, 9)
one.left ← two
one.right ← three
two.left ← four
two.right ← five
three.left ← six
four.left ← seven
six.left ← eight
six.right ← nine
traverse(one, Order.PREORDER)
writeLine()
traverse(one, Order.INORDER)
writeLine()
traverse(one, Order.POSTORDER)
writeLine()
traverse(one, Order.LEVELORDER)
writeLine()
- Output:
1 2 4 7 5 3 6 8 9 7 4 2 5 1 8 6 9 3 7 4 5 2 8 9 6 3 1 1 2 3 4 5 6 7 8 9
Erlang
-module(tree_traversal).
-export([main/0]).
-export([preorder/2, inorder/2, postorder/2, levelorder/2]).
-export([tnode/0, tnode/1, tnode/3]).
-define(NEWLINE, io:format("~n")).
tnode() -> {}.
tnode(V) -> {node, V, {}, {}}.
tnode(V,L,R) -> {node, V, L, R}.
preorder(_,{}) -> ok;
preorder(F,{node,V,L,R}) ->
F(V), preorder(F,L), preorder(F,R).
inorder(_,{}) -> ok;
inorder(F,{node,V,L,R}) ->
inorder(F,L), F(V), inorder(F,R).
postorder(_,{}) -> ok;
postorder(F,{node,V,L,R}) ->
postorder(F,L), postorder(F,R), F(V).
levelorder(_, []) -> [];
levelorder(F, [{}|T]) -> levelorder(F, T);
levelorder(F, [{node,V,L,R}|T]) ->
F(V), levelorder(F, T++[L,R]);
levelorder(F, X) -> levelorder(F, [X]).
main() ->
Tree = tnode(1,
tnode(2,
tnode(4, tnode(7), tnode()),
tnode(5, tnode(), tnode())),
tnode(3,
tnode(6, tnode(8), tnode(9)),
tnode())),
F = fun(X) -> io:format("~p ",[X]) end,
preorder(F, Tree), ?NEWLINE,
inorder(F, Tree), ?NEWLINE,
postorder(F, Tree), ?NEWLINE,
levelorder(F, Tree), ?NEWLINE.
Output:
1 2 4 7 5 3 6 8 9 7 4 2 5 1 8 6 9 3 7 4 5 2 8 9 6 3 1 1 2 3 4 5 6 7 8 9
Euphoria
constant VALUE = 1, LEFT = 2, RIGHT = 3
constant tree = {1,
{2,
{4,
{7, 0, 0},
0},
{5, 0, 0}},
{3,
{6,
{8, 0, 0},
{9, 0, 0}},
0}}
procedure preorder(object tree)
if sequence(tree) then
printf(1,"%d ",{tree[VALUE]})
preorder(tree[LEFT])
preorder(tree[RIGHT])
end if
end procedure
procedure inorder(object tree)
if sequence(tree) then
inorder(tree[LEFT])
printf(1,"%d ",{tree[VALUE]})
inorder(tree[RIGHT])
end if
end procedure
procedure postorder(object tree)
if sequence(tree) then
postorder(tree[LEFT])
postorder(tree[RIGHT])
printf(1,"%d ",{tree[VALUE]})
end if
end procedure
procedure lo(object tree, sequence more)
if sequence(tree) then
more &= {tree[LEFT],tree[RIGHT]}
printf(1,"%d ",{tree[VALUE]})
end if
if length(more) > 0 then
lo(more[1],more[2..$])
end if
end procedure
procedure level_order(object tree)
lo(tree,{})
end procedure
puts(1,"preorder: ")
preorder(tree)
puts(1,'\n')
puts(1,"inorder: ")
inorder(tree)
puts(1,'\n')
puts(1,"postorder: ")
postorder(tree)
puts(1,'\n')
puts(1,"level-order: ")
level_order(tree)
puts(1,'\n')
Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
F#
open System
open System.IO
type Tree<'a> =
| Tree of 'a * Tree<'a> * Tree<'a>
| Empty
let rec inorder tree =
seq {
match tree with
| Tree(x, left, right) ->
yield! inorder left
yield x
yield! inorder right
| Empty -> ()
}
let rec preorder tree =
seq {
match tree with
| Tree(x, left, right) ->
yield x
yield! preorder left
yield! preorder right
| Empty -> ()
}
let rec postorder tree =
seq {
match tree with
| Tree(x, left, right) ->
yield! postorder left
yield! postorder right
yield x
| Empty -> ()
}
let levelorder tree =
let rec loop queue =
seq {
match queue with
| [] -> ()
| (Empty::tail) -> yield! loop tail
| (Tree(x, l, r)::tail) ->
yield x
yield! loop (tail @ [l; r])
}
loop [tree]
[<EntryPoint>]
let main _ =
let tree =
Tree (1,
Tree (2,
Tree (4,
Tree (7, Empty, Empty),
Empty),
Tree (5, Empty, Empty)),
Tree (3,
Tree (6,
Tree (8, Empty, Empty),
Tree (9, Empty, Empty)),
Empty))
let show x = printf "%d " x
printf "preorder: "
preorder tree |> Seq.iter show
printf "\ninorder: "
inorder tree |> Seq.iter show
printf "\npostorder: "
postorder tree |> Seq.iter show
printf "\nlevel-order: "
levelorder tree |> Seq.iter show
0
Factor
USING: accessors combinators deques dlists fry io kernel
math.parser ;
IN: rosetta.tree-traversal
TUPLE: node data left right ;
CONSTANT: example-tree
T{ node f 1
T{ node f 2
T{ node f 4
T{ node f 7 f f }
f
}
T{ node f 5 f f }
}
T{ node f 3
T{ node f 6
T{ node f 8 f f }
T{ node f 9 f f }
}
f
}
}
: preorder ( node quot: ( data -- ) -- )
[ [ data>> ] dip call ]
[ [ left>> ] dip over [ preorder ] [ 2drop ] if ]
[ [ right>> ] dip over [ preorder ] [ 2drop ] if ]
2tri ; inline recursive
: inorder ( node quot: ( data -- ) -- )
[ [ left>> ] dip over [ inorder ] [ 2drop ] if ]
[ [ data>> ] dip call ]
[ [ right>> ] dip over [ inorder ] [ 2drop ] if ]
2tri ; inline recursive
: postorder ( node quot: ( data -- ) -- )
[ [ left>> ] dip over [ postorder ] [ 2drop ] if ]
[ [ right>> ] dip over [ postorder ] [ 2drop ] if ]
[ [ data>> ] dip call ]
2tri ; inline recursive
: (levelorder) ( dlist quot: ( data -- ) -- )
over deque-empty? [ 2drop ] [
[ dup pop-front ] dip {
[ [ data>> ] dip call drop ]
[ drop left>> [ swap push-back ] [ drop ] if* ]
[ drop right>> [ swap push-back ] [ drop ] if* ]
[ nip (levelorder) ]
} 3cleave
] if ; inline recursive
: levelorder ( node quot: ( data -- ) -- )
[ 1dlist ] dip (levelorder) ; inline
: levelorder2 ( node quot: ( data -- ) -- )
[ 1dlist ] dip
[ dup deque-empty? not ] swap '[
dup pop-front
[ data>> @ ]
[ left>> [ over push-back ] when* ]
[ right>> [ over push-back ] when* ] tri
] while drop ; inline
: main ( -- )
example-tree [ number>string write " " write ] {
[ "preorder: " write preorder nl ]
[ "inorder: " write inorder nl ]
[ "postorder: " write postorder nl ]
[ "levelorder: " write levelorder nl ]
[ "levelorder2: " write levelorder2 nl ]
} 2cleave ;
Fantom
class Tree
{
readonly Int label
readonly Tree? left
readonly Tree? right
new make (Int label, Tree? left := null, Tree? right := null)
{
this.label = label
this.left = left
this.right = right
}
Void preorder(|Int->Void| func)
{
func(label)
left?.preorder(func) // ?. will not call method if 'left' is null
right?.preorder(func)
}
Void postorder(|Int->Void| func)
{
left?.postorder(func)
right?.postorder(func)
func(label)
}
Void inorder(|Int->Void| func)
{
left?.inorder(func)
func(label)
right?.inorder(func)
}
Void levelorder(|Int->Void| func)
{
Tree[] nodes := [this]
while (nodes.size > 0)
{
Tree cur := nodes.removeAt(0)
func(cur.label)
if (cur.left != null) nodes.add (cur.left)
if (cur.right != null) nodes.add (cur.right)
}
}
}
class Main
{
public static Void main ()
{
tree := Tree(1,
Tree(2, Tree(4, Tree(7)), Tree(5)),
Tree(3, Tree(6, Tree(8), Tree(9))))
List result := [,]
collect := |Int a -> Void| { result.add(a) }
tree.preorder(collect)
echo ("preorder: " + result.join(" "))
result = [,]
tree.inorder(collect)
echo ("inorder: " + result.join(" "))
result = [,]
tree.postorder(collect)
echo ("postorder: " + result.join(" "))
result = [,]
tree.levelorder(collect)
echo ("levelorder: " + result.join(" "))
}
}
Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 levelorder: 1 2 3 4 5 6 7 8 9
Forth
\ binary tree (dictionary)
: node ( l r data -- node ) here >r , , , r> ;
: leaf ( data -- node ) 0 0 rot node ;
: >data ( node -- ) @ ;
: >right ( node -- ) cell+ @ ;
: >left ( node -- ) cell+ cell+ @ ;
: preorder ( xt tree -- )
dup 0= if 2drop exit then
2dup >data swap execute
2dup >left recurse
>right recurse ;
: inorder ( xt tree -- )
dup 0= if 2drop exit then
2dup >left recurse
2dup >data swap execute
>right recurse ;
: postorder ( xt tree -- )
dup 0= if 2drop exit then
2dup >left recurse
2dup >right recurse
>data swap execute ;
: max-depth ( tree -- n )
dup 0= if exit then
dup >left recurse
swap >right recurse max 1+ ;
defer depthaction
: depthorder ( depth tree -- )
dup 0= if 2drop exit then
over 0=
if >data depthaction drop
else over 1- over >left recurse
swap 1- swap >right recurse
then ;
: levelorder ( xt tree -- )
swap is depthaction
dup max-depth 0 ?do
i over depthorder
loop drop ;
7 leaf 0 4 node
5 leaf 2 node
8 leaf 9 leaf 6 node
0 3 node 1 node value tree
cr ' . tree preorder \ 1 2 4 7 5 3 6 8 9
cr ' . tree inorder \ 7 4 2 5 1 8 6 9 3
cr ' . tree postorder \ 7 4 5 2 8 9 6 3 1
cr tree max-depth . \ 4
cr ' . tree levelorder \ 1 2 3 4 5 6 7 8 9
Fortran
Recursion? Oh dear.
For many years it has been routine to hear murmured exchanges that "Fortran is not a recursive language", which is rather odd because any computer language that allows arithmetic expressions in the usual infix notation as learnt at primary school is fundamentally recursive. Moreover, nothing in Fortran's syntax prevents recursion: routines can invoke each other or themselves without difficulty. It is the implementation that is at fault. Typically, a Fortran compiler produces code for a computer lacking an in-built stack mechanism and this became a habit. For instance, on the IBM1130, entry to a routine was via a BSI instruction, "Branch and Save IAR", which placed the return address (the value of the Instruction Address Register, IAR) at the routine's entry point and commenced execution at the following address. For the IBM360 et al, the instruction was BALR, "Branch and Load Register" (I always edited listings to read BALROG, ahem) whereby the return address was loaded into a specified register. Should such a routine then invoke itself in the same manner, then the first return address will be overwritten by the new address. Only if the routine included special code to save multiple return addresses could such recursion work.
In other words, there has never been any problem with recursive invocations in Fortran, merely in organising the correct return from them. Unless you used the Burroughs Fortran compiler, which being for a computer whose hardware employed a stack mechanism, meant that it all just worked and there was no reason to prevent recursion from working. Except for a large system for the formal manipulation of mathematical expressions, whose major components repeatedly invoked each other without ever bothering to return: large jobs failed via stack overflow!
Otherwise, one can always write detailed code that gives effect to recursive usage, typically involving a variable called SP and an array called STACK. Oddly, such proceedings for the QuickSort algorithm are often declared to be "iterative", presumably because the absence of formally-declared recursive phrases blocks recognition of recursive action.
In the example source, the mainline, GORILLA, does its recursion via array twiddling and in that spirit, uses multiple lists for the "level" style traversal so that one tree clamber only need be made, whereas the recursive equivalent cheats by commanding one clamber for each level. The recursive routines store their state in part via the position within their code - that is, before, between, or after the recursive invocations, and are much easier to compare. Rather than litter the source with separate routines and their declarations for each of the four styles required, routine TARZAN has the four versions together for easy comparison, distinguished by a CASE statement. Actually, the code could be even more compact as in
IF (STYLE.EQ."PRE") CALL OUT(HAS)
IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)
IF (STYLE.EQ."IN") CALL OUT(HAS)
IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)
IF (STYLE.EQ."POST") CALL OUT(HAS)
But that would cloud the simplicity of each separate version, and would be extra messy with the fourth option included. On the other hand, the requirements for formal recursion carry the cost of the entry/exit protocol and moreover must do so for every invocation (though there is sometimes opportunity for end-recursion to be converted into a secret "go to") - avoiding this is why every invocation of TARZAN first checks that it has a live link, rather than coding this once only within TARZAN to return immediately when invoked with a dead link - whereas the array twiddling via SP deals only with what is required and notably, avoids raising the stack if it can. Further, the GORILLA version can if necessary maintain additional information, as is needed for the postorder traversal where, not having state information stored via position in the code (as with the recursive version) it needs to know whether it is returning to a node from which it departed via the rightwards link and so is in the post-traversal state and thus due a postorder action. This could involve an auxiliary array, but here is handled by taking advantage of the sign of the STACK element. This sort of trick might still be possible even if the link values were memory addresses rather than array indices, as many computers do not use their full word size for addressing.
The tree is represented via arrays NODE, LINKL and LINKR, initialised to the set example via some DATA statements rather than being built via a sequence of calls to something like ADDNODE. Old-style Fortran would require separate arrays, though one could mess about with two-dimensional arrays if the type of NODE was compatible. F90 and later enable the definition of compound data types, so that one might speak of NODE(i).CONTENT, NODE(i).LINKLEFT, and NODE(i).LINKRIGHT, or similar. While this offers clear benefits in organisation and documentation there can be surprises, as when a binary search routine was invoked on something like NODE(1:n).KEY and the programme ran a lot slower than the multi-array version! This was because rather than present the routine with an array having a "stride" other than one, the KEY values were copied from the data aggregate to a work area so that they were contiguous for the binary search routine, thereby vitiating its speed advantage over a linear search.
Except for the usage of array MIST having an element zero and the use of an array assignment MIST(:,0) = 0, the GORILLA code is old-style Fortran. One could play tricks with EQUIVALENCE statements to arrange that an array's first element was at index zero, but that would rely on the absence of array bound checking and is more difficult with multi-dimensional arrays. Instead, one would make do either by having a separate list length variable, or else remembering the offsets... The MODULE usage requires F90 or later and provides a convenient protocol for global data, otherwise one must mess about with COMMON or parameter hordes. If that were done, the B6700 compiler would have handled it. But for the benefit of trembling modern compilers it also contains the fearsome new attribute, RECURSIVE, to flog the compilers into what was formalised for Algol in 1960 and was available for free via Burroughs in the 1970s.
On the other hand, the early-style Fortran DO-loop would always execute once, because the test was made only at the end of an iteration, and here, routine JANE does not know the value of MAXLEVEL until after the first iteration. Code such as
DO GASP = 1,MAXLEVEL
CALL TARZAN(1,HOW)
END DO
Would not work with modern Fortran, because the usual approach is to calculate the iteration count from the DO-loop parameters at the start of the DO-loop, and possibly not execute it at all if that count is not positive. This also means that with each iteration, the count must be decremented and the index variable adjusted; extra effort. There is no equivalent of Pascal's Repeat ... until condition;
, so, in place of a nice "structured" statement with clear interpretation, there is some messy code with a label and a GO TO, oh dear.
Source
MODULE ARAUCARIA !Cunning crosswords, also.
INTEGER ENUFF !To suit the set example.
PARAMETER (ENUFF = 9) !This will do.
INTEGER NODE(ENUFF),LINKL(ENUFF),LINKR(ENUFF) !The nodes, and their links.
DATA NODE/ 1,2,3,4,5,6,7,8,9/ !Value = index. A rather boring payload.
DATA LINKL/2,4,6,7,0,8,0,0,0/ !"Left" and "Right" are as looking at the page.
DATA LINKR/3,5,0,0,0,9,0,0,0/ !If one thinks within the tree, they're the other way around!
C 1 !Thus, looking from the "1", to the right is "2" and to the left is "3".
C / \ !But, looking at the scheme, to the left is "2" and to the right is "3".
C / \ !This latter seems to be the popular view from the outside, not within the data.
C / \ !Similarily, although called a "tree", the depiction is upside down!
C 2 3 !How can computers be expected to keep up with this contrariness?
C / \ / !Humm, no example of a rightwards link with no leftwards link.
C 4 5 6 !Topologically equivalent, but not so in usage.
C / / \
C 7 8 9
INTEGER N,LIST(ENUFF) !This is to be developed.
INTEGER LEVEL,MAXLEVEL !While these vary in various ways.
INTEGER GASP !Communication from JANE.
CONTAINS !No checks for invalid links, etc.
SUBROUTINE OUT(IS) !Append a value to a list.
INTEGER IS !The value.
N = N + 1 !The list's count so far.
LIST(N) = IS !Place.
END SUBROUTINE OUT !Eventually, the list can be written in one go.
RECURSIVE SUBROUTINE TARZAN(HAS,STYLE) !Skilled at tree traversal, is he.
INTEGER HAS !The current position.
CHARACTER*(*) STYLE !Traversal type.
LEVEL = LEVEL + 1 !A leap is made.
IF (LEVEL.GT.MAXLEVEL) MAXLEVEL = LEVEL !Staring at the moon.
SELECT CASE(STYLE) !And, in what manner?
CASE ("PRE") !Declare the position first.
CALL OUT(HAS) !Thus.
IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)
IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)
CASE ("IN") !Or in the middle.
IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)
CALL OUT(HAS) !Thus.
IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)
CASE ("POST") !Or at the end.
IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)
IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)
CALL OUT(HAS) !Thus.
CASE ("LEVEL") !Or at specified levels.
IF (LEVEL.EQ.GASP) CALL OUT(HAS) !Such as this?
IF (LINKL(HAS).GT.0) CALL TARZAN(LINKL(HAS),STYLE)
IF (LINKR(HAS).GT.0) CALL TARZAN(LINKR(HAS),STYLE)
CASE DEFAULT !This shouldn't happen.
WRITE (6,*) "Unknown style ",STYLE !But, paranoia.
STOP "No can do!" !Rather than flounder about.
END SELECT !That was simple.
LEVEL = LEVEL - 1 !Sag back.
END SUBROUTINE TARZAN !Not like George of the Jungle.
SUBROUTINE JANE(HOW) !Tells Tarzan what to do.
CHARACTER*(*) HOW !A single word suffices.
N = 0 !No positions trampled.
LEVEL = 0 !Starting on the ground.
MAXLEVEL = 0 !The ascent follows.
IF (HOW.NE."LEVEL") THEN !Ordinary styles?
CALL TARZAN(1,HOW) !Yes. From the root, go...
ELSE !But this is not tree-structured.
GASP = 0 !Instead, we ascend through the canopy in stages.
1 GASP = GASP + 1 !Up one stage.
CALL TARZAN(1,HOW) !And do it all again.
IF (GASP.LT.MAXLEVEL) GO TO 1 !Are we there yet?
END IF !Don't know MAXLEVEL until after the first clamber.
Cast forth the list.
WRITE (6,10) HOW,NODE(LIST(1:N)) !Show spoor.
10 FORMAT (A6,"-order:",66(1X,I0)) !Large enough.
WRITE (6,*) !Sigh.
END SUBROUTINE JANE !That was simple.
END MODULE ARAUCARIA !The monkeys are puzzled.
PROGRAM GORILLA !No fancy stuff. Just brute force.
USE ARAUCARIA !This is for lightweight but cunning monkeys.
INTEGER IT !A finger.
INTEGER SP,STACK(ENUFF) !The tree may be slim.
INTEGER SLEVL(ENUFF) !So prepare for maximum usage.
INTEGER MIST(ENUFF,0:ENUFF) !Multiple lists.
Chase the links preorder style: name the node, delve its left link, delve its right link.
N = 0 !No nodes have been visited.
SP = 0 !My stack is empty.
IT = 1 !I start at the root.
10 N = N + 1 !Another node arrived at.
LIST(N) = IT !Finger it.
IF (LINKL(IT).GT.0) THEN !A left link?
IF (LINKR(IT).GT.0) THEN !Yes. A right link also?
SP = SP + 1 !Yes. Stack it up.
STACK(SP) = LINKR(IT) !For later investigation.
END IF !So much for the right link.
IT = LINKL(IT) !Fingered by the left link.
GO TO 10 !See what happens.
END IF !But if there is no left link,
IF (LINKR(IT).GT.0) THEN !There still might be a right link.
IT = LINKR(IT) !There is.
GO TO 10 !See what happens.
END IF !And if there are no links,
IF (SP.GT.0) THEN !Perhaps the stack has bottomed out too?
IT = STACK(SP) !No, this was deferred.
SP = SP - 1 !So, pick up where we left off.
GO TO 10 !And carry on.
END IF !So much for unstacking.
WRITE (6,12) "Preorder",NODE(LIST(1:N)) !I've got a little list!
12 FORMAT (A12,":",66(1X,I0))
CALL JANE("PRE") !Try it fancy style.
Chase the links inorder style: delve left fully, name the node and try its right, then unstack.
N = 0 !No nodes have been visited.
SP = 0 !My stack is empty.
IT = 1 !I start at the root.
20 SP = SP + 1 !I'm on the way down.
STACK(SP) = IT !So, save this position to later retreat to.
IF (LINKL(IT).GT.0) THEN !Can I delve further left?
IT = LINKL(IT) !Yes.
GO TO 20 !And see what happens.
END IF !So much for diving.
21 IF (SP.GT.0) THEN !Can I retreat?
IT = STACK(SP) !Yes.
SP = SP - 1 !Go back to whence I had delved left.
N = N + 1 !This now counts as a place in order.
LIST(N) = IT !So list it.
IF (LINKR(IT).GT.0) THEN!Have I a rightwards path?
IT = LINKR(IT) !Yes. Take it.
GO TO 20 !And delve therefrom.
END IF !This node is now finished with.
GO TO 21 !So, try for another retreat.
END IF !So much for unstacking.
WRITE (6,12) "Inorder",NODE(LIST(1:N)) !I've got a little list!
CALL JANE("IN") !Try with more style.
Chase the links postorder style: delve left fully, delve right, name the node, then unstack.
N = 0 !No nodes have been visited.
SP = 0 !My stack is empty.
IT = 1 !I start at the root.
30 SP = SP + 1 !Action follows delving,
STACK(SP) = IT !So this node will be returned to.
IF (LINKL(IT).GT.0) THEN !Take any leftwards link straightaway.
IT = LINKL(IT) !Thus.
GO TO 30 !Thanks to the stack, we'll return to IT (as was).
END IF !But if there is no leftwards link to follow,
IF (LINKR(IT).GT.0) THEN !Perhaps there is a rightwards one?
STACK(SP) = -STACK(SP) !=-IT Mark the stacked finger as a rightwards lurch!
IT = LINKR(IT) !The rightwards link is now to be taken.
GO TO 30 !Thus start on a sub-tree.
END IF !But if there is no rightwards link either,
31 IF (SP.GT.0) THEN !See if there is anywhere to retreat to.
IT = STACK(SP) !The same IT placed at 30 if we dropped into 31.
SP = SP - 1 !But now we're in a different mood.
IF (IT.LT.0) THEN !Returning to what had been a rightwards departure?
N = N + 1 !Yes! Then this node is post-interest.
LIST(N) = -IT !So, time to roll it forth at last.
GO TO 31 !And retreat some more.
END IF !But if we hadn't gone right from IT,
IF (LINKR(IT).LE.0) THEN!We had gone left.
N = N + 1 !And now there is nowhere rightwards.
LIST(N) = IT !So this node is post-interest.
GO TO 31 !And retreat some more.
END IF !But if there is a rightwards leap,
SP = SP + 1 !Prepare to return to it,
STACK(SP) = -IT !Marked as having gone rightwards.
IT = LINKR(IT) !The rightwards move.
GO TO 30 !Peruse a fresh sub-tree.
END IF !And if the stack is reduced,
WRITE (6,12) "Postorder",NODE(LIST(1:N)) !Results!
CALL JANE("POST") !The same again?
Chase the nodes level style.
SP = 0 !My stack is empty.
IT = 1 !I start at the root.
LEVEL = 0 !On the ground.
MAXLEVEL = 0 !No ascent as yet.
MIST(:,0) = 0 !At all levels, nothing.
40 LEVEL = LEVEL + 1 !Every arrival is one level up.
IF (LEVEL.GT.MAXLEVEL) MAXLEVEL = LEVEL !Note the most high.
MIST(LEVEL,0) = MIST(LEVEL,0) + 1 !The count at that level.
MIST(LEVEL,MIST(LEVEL,0)) = IT !Add to the level's list.
IF (LINKL(IT).GT.0) THEN !Righto, can we go left?
IF (LINKR(IT).GT.0) THEN !Yes. Rightwards as well?
SP = SP + 1 !Yes! This will have to wait.
STACK(SP) = LINKR(IT) !So remember it,
SLEVL(SP) = LEVEL !And what level we're at now.
END IF !I can only go one way at a time.
IT = LINKL(IT) !Accept the fingered leftwards lurch.
GO TO 40 !Go to IT.
END IF !But if there is no leftwards link,
IF (LINKR(IT).GT.0) THEN !Perhaps there is a rightwards one?
IT = LINKR(IT) !There is.
GO TO 40 !Go to IT.
END IF !And if there are no further links,
IF (SP.GT.0) THEN !Perhaps we can retreat to what was deferred.
IT = STACK(SP) !The finger.
LEVEL = SLEVL(SP) !The level.
SP = SP - 1 !Wind back the stack.
GO TO 40 !Go to IT.
END IF !So much for the stack.
WRITE (6,12) "Levelorder", !Roll the lists in ascending LEVEL order.
1 (NODE(MIST(LEVEL,1:MIST(LEVEL,0))), LEVEL = 1,MAXLEVEL)
CALL JANE("LEVEL") !Alternatively...
END !So much for that.
Output
Alternately GORILLA-style, and JANE-style:
Preorder: 1 2 4 7 5 3 6 8 9 PRE-order: 1 2 4 7 5 3 6 8 9 Inorder: 7 4 2 5 1 8 6 9 3 IN-order: 7 4 2 5 1 8 6 9 3 Postorder: 7 4 5 2 8 9 6 3 1 POST-order: 7 4 5 2 8 9 6 3 1 Levelorder: 1 2 3 4 5 6 7 8 9 LEVEL-order: 1 2 3 4 5 6 7 8 9
FreeBASIC
#define NULL 0
Dim Shared As Byte maxnodos = 100
Dim Shared As Byte raiz = 0
Dim Shared As Byte izda = 1
Dim Shared As Byte dcha = 2
Dim Shared As Byte arbol(maxnodos, 3)
Sub crear_arbol()
arbol(1, raiz) = 1
arbol(1, izda) = 2 : arbol(1, dcha) = 3
arbol(2, raiz) = 2
arbol(2, izda) = 4 : arbol(2, dcha) = 5
arbol(3, raiz) = 3
arbol(3, izda) = 6 : arbol(3, dcha) = NULL
arbol(4, raiz) = 4
arbol(4, izda) = 7 : arbol(4, dcha) = NULL
arbol(5, raiz) = 5
arbol(5, izda) = NULL : arbol(5, dcha) = NULL
arbol(6, raiz) = 6
arbol(6, izda) = 8 : arbol(6, dcha) = 9
arbol(7, raiz) = 7
arbol(7, izda) = NULL : arbol(7, dcha) = NULL
arbol(8, raiz) = 8
arbol(8, izda) = NULL : arbol(8, dcha) = NULL
arbol(9, raiz) = 9
arbol(9, izda) = NULL : arbol(9, dcha) = NULL
End Sub
Sub recorrido_preorder(nodo As Byte)
If nodo <> NULL Then
Print arbol(nodo, raiz);
recorrido_preorder(arbol(nodo, izda))
recorrido_preorder(arbol(nodo, dcha))
End If
End Sub
Sub recorrido_postorder(nodo As Byte)
If nodo <> NULL Then
recorrido_postorder(arbol(nodo, izda))
recorrido_postorder(arbol(nodo, dcha))
Print arbol(nodo, raiz);
End If
End Sub
Sub recorrido_inorden(nodo As Byte)
If nodo <> NULL Then
recorrido_inorden(arbol(nodo, izda))
Print arbol(nodo, raiz);
recorrido_inorden(arbol(nodo, dcha))
End If
End Sub
Sub recorrido_ordenXnivel(nodo As Byte)
Dim As Byte actual = 1
Dim As Byte primero_libre = actual + 1
Dim As Byte cola(maxnodos)
cola(actual) = nodo
While cola(actual) <> NULL
If arbol(cola(actual), izda) <> NULL Then
cola(primero_libre) = arbol(cola(actual), izda)
primero_libre += 1
End If
If arbol(cola(actual), dcha) <> NULL Then
cola(primero_libre) = arbol(cola(actual), dcha)
primero_libre += 1
End If
Print arbol(cola(actual), raiz);
actual += 1
Wend
End Sub
- Output:
Preorder: 1 2 4 7 5 3 6 8 9 Inorder: 7 4 2 5 1 8 6 9 3 Postorder: 7 4 5 2 8 9 6 3 1 Levelorder: 1 2 3 4 5 6 7 8 9
FunL
data Tree = Empty | Node( value, left, right )
def
preorder( Empty ) = []
preorder( Node(v, l, r) ) = [v] + preorder( l ) + preorder( r )
inorder( Empty ) = []
inorder( Node(v, l, r) ) = inorder( l ) + [v] + inorder( r )
postorder( Empty ) = []
postorder( Node(v, l, r) ) = postorder( l ) + postorder( r ) + [v]
levelorder( x ) =
def
order( [] ) = []
order( Empty : xs ) = order( xs )
order( Node(v, l, r) : xs ) = v : order( xs + [l, r] )
order( [x] )
tree = Node( 1,
Node( 2,
Node( 4,
Node( 7, Empty, Empty ),
Empty ),
Node( 5, Empty, Empty ) ),
Node( 3,
Node( 6,
Node( 8, Empty, Empty ),
Node( 9, Empty, Empty ) ),
Empty ) )
println( preorder(tree) )
println( inorder(tree) )
println( postorder(tree) )
println( levelorder(tree) )
- Output:
[1, 2, 4, 7, 5, 3, 6, 8, 9] [7, 4, 2, 5, 1, 8, 6, 9, 3] [7, 4, 5, 2, 8, 9, 6, 3, 1] [1, 2, 3, 4, 5, 6, 7, 8, 9]
Fōrmulæ
Fōrmulæ programs are not textual, visualization/edition of programs is done showing/manipulating structures but not text. Moreover, there can be multiple visual representations of the same program. Even though it is possible to have textual representation —i.e. XML, JSON— they are intended for storage and transfer purposes more than visualization and edition.
Programs in Fōrmulæ are created/edited online in its website.
In this page you can see and run the program(s) related to this task and their results. You can also change either the programs or the parameters they are called with, for experimentation, but remember that these programs were created with the main purpose of showing a clear solution of the task, and they generally lack any kind of validation.
Solution
Notice that the action to do when visiting a node is provided as a lambda expression:
Test case for pre-order
Test case for in-order
Test case for post-order
Test case for breadth-first search
GFA Basic
maxnodes%=100 ! set a limit to size of tree
content%=0 ! index of content field
left%=1 ! index of left tree
right%=2 ! index of right tree
DIM tree%(maxnodes%,3) ! create space for tree
'
OPENW 1
CLEARW 1
'
@create_tree
PRINT "Preorder: ";
@preorder_traversal(1)
PRINT ""
PRINT "Inorder: ";
@inorder_traversal(1)
PRINT ""
PRINT "Postorder: ";
@postorder_traversal(1)
PRINT ""
PRINT "Levelorder: ";
@levelorder_traversal(1)
PRINT ""
'
~INP(2)
CLOSEW 1
'
' Define the example tree
'
PROCEDURE create_tree
tree%(1,content%)=1
tree%(1,left%)=2
tree%(1,right%)=3
tree%(2,content%)=2
tree%(2,left%)=4
tree%(2,right%)=5
tree%(3,content%)=3
tree%(3,left%)=6
tree%(3,right%)=0 ! 0 is used for no subtree
tree%(4,content%)=4
tree%(4,left%)=7
tree%(4,right%)=0
tree%(5,content%)=5
tree%(5,left%)=0
tree%(5,right%)=0
tree%(6,content%)=6
tree%(6,left%)=8
tree%(6,right%)=9
tree%(7,content%)=7
tree%(7,left%)=0
tree%(7,right%)=0
tree%(8,content%)=8
tree%(8,left%)=0
tree%(8,right%)=0
tree%(9,content%)=9
tree%(9,left%)=0
tree%(9,right%)=0
RETURN
'
' Preorder traversal from given node
'
PROCEDURE preorder_traversal(node%)
IF node%<>0 ! 0 means there is no node
PRINT tree%(node%,content%);
preorder_traversal(tree%(node%,left%))
preorder_traversal(tree%(node%,right%))
ENDIF
RETURN
'
' Postorder traversal from given node
'
PROCEDURE postorder_traversal(node%)
IF node%<>0 ! 0 means there is no node
postorder_traversal(tree%(node%,left%))
postorder_traversal(tree%(node%,right%))
PRINT tree%(node%,content%);
ENDIF
RETURN
'
' Inorder traversal from given node
'
PROCEDURE inorder_traversal(node%)
IF node%<>0 ! 0 means there is no node
inorder_traversal(tree%(node%,left%))
PRINT tree%(node%,content%);
inorder_traversal(tree%(node%,right%))
ENDIF
RETURN
'
' Level order traversal from given node
'
PROCEDURE levelorder_traversal(node%)
LOCAL nodes%,first_free%,current%
'
' Set up initial queue of nodes
'
DIM nodes%(maxnodes%) ! some working space to store queue of nodes
current%=1
nodes%(current%)=node%
first_free%=current%+1
'
WHILE nodes%(current%)<>0
' add the children of current node onto queue
IF tree%(nodes%(current%),left%)<>0
nodes%(first_free%)=tree%(nodes%(current%),left%)
first_free%=first_free%+1
ENDIF
IF tree%(nodes%(current%),right%)<>0
nodes%(first_free%)=tree%(nodes%(current%),right%)
first_free%=first_free%+1
ENDIF
' print the current node content
PRINT tree%(nodes%(current%),content%);
' advance to next node
current%=current%+1
WEND
RETURN
Go
Individually allocated nodes
This is like many examples on this page.
package main
import "fmt"
type node struct {
value int
left, right *node
}
func (n *node) iterPreorder(visit func(int)) {
if n == nil {
return
}
visit(n.value)
n.left.iterPreorder(visit)
n.right.iterPreorder(visit)
}
func (n *node) iterInorder(visit func(int)) {
if n == nil {
return
}
n.left.iterInorder(visit)
visit(n.value)
n.right.iterInorder(visit)
}
func (n *node) iterPostorder(visit func(int)) {
if n == nil {
return
}
n.left.iterPostorder(visit)
n.right.iterPostorder(visit)
visit(n.value)
}
func (n *node) iterLevelorder(visit func(int)) {
if n == nil {
return
}
for queue := []*node{n}; ; {
n = queue[0]
visit(n.value)
copy(queue, queue[1:])
queue = queue[:len(queue)-1]
if n.left != nil {
queue = append(queue, n.left)
}
if n.right != nil {
queue = append(queue, n.right)
}
if len(queue) == 0 {
return
}
}
}
func main() {
tree := &node{1,
&node{2,
&node{4,
&node{7, nil, nil},
nil},
&node{5, nil, nil}},
&node{3,
&node{6,
&node{8, nil, nil},
&node{9, nil, nil}},
nil}}
fmt.Print("preorder: ")
tree.iterPreorder(visitor)
fmt.Println()
fmt.Print("inorder: ")
tree.iterInorder(visitor)
fmt.Println()
fmt.Print("postorder: ")
tree.iterPostorder(visitor)
fmt.Println()
fmt.Print("level-order: ")
tree.iterLevelorder(visitor)
fmt.Println()
}
func visitor(value int) {
fmt.Print(value, " ")
}
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
Flat slice
Alternative representation. Like Wikipedia Binary tree#Arrays
package main
import "fmt"
// flat, level-order representation.
// for node at index k, left child has index 2k, right child has index 2k+1.
// a value of -1 means the node does not exist.
type tree []int
func main() {
t := tree{1, 2, 3, 4, 5, 6, -1, 7, -1, -1, -1, 8, 9}
visitor := func(n int) {
fmt.Print(n, " ")
}
fmt.Print("preorder: ")
t.iterPreorder(visitor)
fmt.Print("\ninorder: ")
t.iterInorder(visitor)
fmt.Print("\npostorder: ")
t.iterPostorder(visitor)
fmt.Print("\nlevel-order: ")
t.iterLevelorder(visitor)
fmt.Println()
}
func (t tree) iterPreorder(visit func(int)) {
var traverse func(int)
traverse = func(k int) {
if k >= len(t) || t[k] == -1 {
return
}
visit(t[k])
traverse(2*k + 1)
traverse(2*k + 2)
}
traverse(0)
}
func (t tree) iterInorder(visit func(int)) {
var traverse func(int)
traverse = func(k int) {
if k >= len(t) || t[k] == -1 {
return
}
traverse(2*k + 1)
visit(t[k])
traverse(2*k + 2)
}
traverse(0)
}
func (t tree) iterPostorder(visit func(int)) {
var traverse func(int)
traverse = func(k int) {
if k >= len(t) || t[k] == -1 {
return
}
traverse(2*k + 1)
traverse(2*k + 2)
visit(t[k])
}
traverse(0)
}
func (t tree) iterLevelorder(visit func(int)) {
for _, n := range t {
if n != -1 {
visit(n)
}
}
}
Groovy
Uses Groovy Node and NodeBuilder classes
def preorder;
preorder = { Node node ->
([node] + node.children().collect { preorder(it) }).flatten()
}
def postorder;
postorder = { Node node ->
(node.children().collect { postorder(it) } + [node]).flatten()
}
def inorder;
inorder = { Node node ->
def kids = node.children()
if (kids.empty) [node]
else if (kids.size() == 1 && kids[0].'@right') [node] + inorder(kids[0])
else inorder(kids[0]) + [node] + (kids.size()>1 ? inorder(kids[1]) : [])
}
def levelorder = { Node node ->
def nodeList = []
def level = [node]
while (!level.empty) {
nodeList += level
def nextLevel = level.collect { it.children() }.flatten()
level = nextLevel
}
nodeList
}
class BinaryNodeBuilder extends NodeBuilder {
protected Object postNodeCompletion(Object parent, Object node) {
assert node.children().size() < 3
node
}
}
Verify that BinaryNodeBuilder will not allow a node to have more than 2 children
try {
new BinaryNodeBuilder().'1' {
a {}
b {}
c {}
}
println 'not limited to binary tree\r\n'
} catch (org.codehaus.groovy.transform.powerassert.PowerAssertionError e) {
println 'limited to binary tree\r\n'
}
Test case #1 (from the task definition)
// 1
// / \
// 2 3
// / \ /
// 4 5 6
// / / \
// 7 8 9
def tree1 = new BinaryNodeBuilder().
'1' {
'2' {
'4' { '7' {} }
'5' {}
}
'3' {
'6' { '8' {}; '9' {} }
}
}
Test case #2 (tests single right child)
// 1
// / \
// 2 3
// / \ /
// 4 5 6
// \ / \
// 7 8 9
def tree2 = new BinaryNodeBuilder().
'1' {
'2' {
'4' { '7'(right:true) {} }
'5' {}
}
'3' {
'6' { '8' {}; '9' {} }
}
}
Run tests:
def test = { tree ->
println "preorder: ${preorder(tree).collect{it.name()}}"
println "preorder: ${tree.depthFirst().collect{it.name()}}"
println "postorder: ${postorder(tree).collect{it.name()}}"
println "inorder: ${inorder(tree).collect{it.name()}}"
println "level-order: ${levelorder(tree).collect{it.name()}}"
println "level-order: ${tree.breadthFirst().collect{it.name()}}"
println()
}
test(tree1)
test(tree2)
Output:
limited to binary tree preorder: [1, 2, 4, 7, 5, 3, 6, 8, 9] preorder: [1, 2, 4, 7, 5, 3, 6, 8, 9] postorder: [7, 4, 5, 2, 8, 9, 6, 3, 1] inorder: [7, 4, 2, 5, 1, 8, 6, 9, 3] level-order: [1, 2, 3, 4, 5, 6, 7, 8, 9] level-order: [1, 2, 3, 4, 5, 6, 7, 8, 9] preorder: [1, 2, 4, 7, 5, 3, 6, 8, 9] preorder: [1, 2, 4, 7, 5, 3, 6, 8, 9] postorder: [7, 4, 5, 2, 8, 9, 6, 3, 1] inorder: [4, 7, 2, 5, 1, 8, 6, 9, 3] level-order: [1, 2, 3, 4, 5, 6, 7, 8, 9] level-order: [1, 2, 3, 4, 5, 6, 7, 8, 9]
Haskell
Left Right nodes
---------------------- TREE TRAVERSAL --------------------
data Tree a
= Empty
| Node
{ value :: a,
left :: Tree a,
right :: Tree a
}
preorder, inorder, postorder, levelorder :: Tree a -> [a]
preorder Empty = []
preorder (Node v l r) = v : preorder l <> preorder r
inorder Empty = []
inorder (Node v l r) = inorder l <> (v : inorder r)
postorder Empty = []
postorder (Node v l r) = postorder l <> postorder r <> [v]
levelorder x = loop [x]
where
loop [] = []
loop (Empty : xs) = loop xs
loop (Node v l r : xs) = v : loop (xs <> [l, r])
--------------------------- TEST -------------------------
tree :: Tree Int
tree =
Node
1
( Node
2
(Node 4 (Node 7 Empty Empty) Empty)
(Node 5 Empty Empty)
)
( Node
3
(Node 6 (Node 8 Empty Empty) (Node 9 Empty Empty))
Empty
)
asciiTree :: String
asciiTree =
unlines
[ " 1",
" / \\",
" / \\",
" / \\",
" 2 3",
" / \\ /",
" 4 5 6",
" / / \\",
" 7 8 9"
]
-------------------------- OUTPUT ------------------------
main :: IO ()
main = do
putStrLn asciiTree
mapM_ putStrLn $
zipWith
( \s xs ->
justifyLeft 14 ' ' (s <> ":")
<> unwords (show <$> xs)
)
["preorder", "inorder", "postorder", "level-order"]
([preorder, inorder, postorder, levelorder] <*> [tree])
where
justifyLeft n c s = take n (s <> replicate n c)
- Output:
1 / \ / \ / \ 2 3 / \ / 4 5 6 / / \ 7 8 9 preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
Data.Tree nodes
Writing the first three traversals in terms of foldTree, and the last as concat . levels:
import Data.Bool (bool)
import Data.Tree (Tree (..), drawForest, drawTree, foldTree)
---------------------- TREE TRAVERSAL --------------------
inorder, postorder, preorder :: a -> [[a]] -> [a]
inorder x [] = [x]
inorder x (y : xs) = y <> [x] <> concat xs
postorder x xs = concat xs <> [x]
preorder x xs = x : concat xs
levelOrder :: Tree a -> [a]
levelOrder = concat . levels
levels :: Tree a -> [[a]]
levels tree = go tree []
where
go (Node x xs) a =
let (h, t) = case a of
[] -> ([], [])
(y : ys) -> (y, ys)
in (x : h) : foldr go t xs
nodeCount,
treeDepth,
treeMax,
treeMin,
treeProduct,
treeSum,
treeWidth ::
Int -> [Int] -> Int
nodeCount = const (succ . sum)
treeDepth = const (succ . foldr max 1)
treeMax x xs = maximum (x : xs)
treeMin x xs = minimum (x : xs)
treeProduct x xs = x * product xs
treeSum x xs = x + sum xs
treeWidth _ [] = 1
treeWidth _ xs = sum xs
treeLeaves :: Tree a -> [a]
treeLeaves = foldTree go
where
go x [] = [x]
go _ xs = concat xs
--------------------------- TEST -------------------------
tree :: Tree Int
tree =
Node
1
[ Node 2 [Node 4 [Node 7 []], Node 5 []],
Node 3 [Node 6 [Node 8 [], Node 9 []]]
]
main :: IO ()
main = do
putStrLn $ drawTree $ fmap show tree
mapM_
print
( [foldTree]
<*> [preorder, inorder, postorder]
<*> [tree]
)
print $ levelOrder tree
putStrLn ""
(putStrLn . unlines)
( ( \(k, f) ->
justifyRight 7 ' ' k
<> " -> "
<> justifyLeft 6 ' ' (show $ foldTree f tree)
)
<$> [ ("Count", nodeCount),
("Layers", treeDepth),
("Max", treeMax),
("Min", treeMin),
("Product", treeProduct),
("Sum", treeSum),
("Leaves", treeWidth)
]
)
justifyLeft, justifyRight :: Int -> Char -> String -> String
justifyLeft n c s = take n (s <> replicate n c)
justifyRight n c = (drop . length) <*> (replicate n c <>)
1 | +- 2 | | | +- 4 | | | | | `- 7 | | | `- 5 | `- 3 | `- 6 | +- 8 | `- 9 [1,2,4,7,5,3,6,8,9] [7,4,2,5,1,8,6,9,3] [7,4,5,2,8,9,6,3,1] [1,2,3,4,5,6,7,8,9] Count -> 9 Layers -> 5 Max -> 9 Min -> 1 Product -> 362880 Sum -> 45 Leaves -> 4
Icon and Unicon
Output:
->bintree procedure preorder: 1 2 4 7 5 3 6 8 9 procedure inorder: 7 4 2 5 1 8 6 9 3 procedure postorder: 7 4 5 2 8 9 6 3 1 procedure levelorder: 1 2 3 4 5 6 7 8 9 ->
Isabelle
theory Tree
imports Main
begin
datatype 'a tree = Leaf | Node "'a tree" 'a "'a tree"
definition example :: "int tree" where
"example =
Node
(Node
(Node
(Node Leaf 7 Leaf)
4
Leaf
)
2
(Node Leaf 5 Leaf)
)
1
(Node
(Node
(Node Leaf 8 Leaf)
6
(Node Leaf 9 Leaf)
)
3
Leaf
)"
fun preorder :: "'a tree ? 'a list" where
"preorder Leaf = []"
| "preorder (Node l a r) = a # preorder l @ preorder r"
lemma "preorder example = [1, 2, 4, 7, 5, 3, 6, 8, 9]" by code_simp
fun inorder :: "'a tree ? 'a list" where
"inorder Leaf = []"
| "inorder (Node l a r) = inorder l @ [a] @ inorder r"
lemma "inorder example = [7, 4, 2, 5, 1, 8, 6, 9, 3]" by code_simp
fun postorder :: "'a tree ? 'a list" where
"postorder Leaf = []"
| "postorder (Node l a r) = postorder l @ postorder r @ [a]"
lemma "postorder example = [7, 4, 5, 2, 8, 9, 6, 3, 1]" by code_simp
lemma
"set (inorder t) = set (preorder t)"
"set (preorder t) = set (postorder t)"
"set (inorder t) = set (postorder t)"
by(induction t, simp, simp)+
text‹
For a breadth first search, we will have a queue of the nodes we still
want to visit. The type of the queue is \<^typ>‹'a tree list›.
With each step, summing the sizes of the subtrees in the queue,
the queue gets smaller. Thus, the breadth first search terminates.
Isabelle cannot figure out this termination argument automatically,
so we provide some help by defining what the size of a tree is.
›
fun tree_size :: "'a tree ? nat" where
"tree_size Leaf = 1"
| "tree_size (Node l _ r) = 1 + tree_size l + tree_size r"
function (sequential) bfs :: "'a tree list ? 'a list" where
"bfs [] = []"
| "bfs (Leaf#q) = bfs q"
| "bfs ((Node l a r)#q) = a # bfs (q @ [l,r])"
by pat_completeness auto
termination bfs
by(relation "measure (?qs. sum_list (map tree_size qs))") simp+
fun levelorder :: "'a tree ? 'a list" where
"levelorder t = bfs [t]"
lemma "levelorder example = [1, 2, 3, 4, 5, 6, 7, 8, 9]" by code_simp
end
J
preorder=: ]S:0
postorder=: ([:; postorder&.>@}.) , >@{.
levelorder=: ;@({::L:1 _~ [: (/: #@>) <S:1@{::)
inorder=: ([:; inorder&.>@(''"_`(1&{)@.(1<#))) , >@{. , [:; inorder&.>@}.@}.
Required example:
N2=: conjunction def '(<m),(<n),<y'
N1=: adverb def '(<m),<y'
L=: adverb def '<m'
tree=: 1 N2 (2 N2 (4 N1 (7 L)) 5 L) 3 N1 6 N2 (8 L) 9 L
This tree is organized in a pre-order fashion
preorder tree
1 2 4 7 5 3 6 8 9
post-order is not that much different from pre-order, except that the children must extracted before the parent.
postorder tree
7 4 5 2 8 9 6 3 1
Implementing in-order is more complex because we must sometimes test whether we have any leaves, instead of relying on J's implicit looping over lists
inorder tree
7 4 2 5 1 8 6 9 3
level-order can be accomplished by constructing a map of the locations of the leaves, sorting these map locations by their non-leaf indices and using the result to extract all leaves from the tree. Elements at the same level with the same parent will have the same sort keys and thus be extracted in preorder fashion, which works just fine.
levelorder tree
1 2 3 4 5 6 7 8 9
For J novices, here's the tree instance with a few redundant parenthesis:
tree=: 1 N2 (2 N2 (4 N1 (7 L)) (5 L)) (3 N1 (6 N2 (8 L) (9 L)))
Syntactically, N2 is a binary node expressed as m N2 n y
. N1 is a node with a single child, expressed as m N2 y
. L is a leaf node, expressed as m L
. In all three cases, the parent value (m
) for the node appears on the left, and the child tree(s) appear on the right. (And n
must be parenthesized if it is not a single word.)
J: Alternate implementation
Of course, there are other ways of representing tree structures in J. One fairly natural approach pairs a list of data with a matching list of parent indices. For example:
example=:1 8 3 4 7 5 9 6 2,: 0 7 0 8 3 8 7 2 0
Here, we have two possible ways of identifying the root node. It can be in a known place in the list (index 0, for this example). But it is also the only node which is its own parent. For this task we'll use the more general (and thus slower) approach which allows us to place the root node anywhere in the sequence.
Next, let's define a few utilities:
depth=: +/@((~: , (~: i.@#@{.)~) {:@,)@({~^:a:)
reorder=:4 :0
'data parent'=. y
data1=. x{data
parent1=. x{data1 i. parent{data
if. 0=L.y do. data1,:parent1 else. data1;parent1 end.
)
data=:3 :'data[''data parent''=. y'
parent=:3 :'parent[''data parent''=. y'
childinds=: [: <:@(2&{.@-.&> #\) (</. #\)`(]~.)`(a:"0)}~
Here, data
extracts the list of data items from the tree and parent
extracts the structure from the tree.
depth
examines the parent structure and returns the distance of each node from the root.
reorder
is like indexing, except that it returns an equivalent tree (with the structural elements updated to maintain the original tree structure). The left argument for reorder should select the entire tree. Selecting partial trees is a more complex problem which needs specifications about how to deal with issues such as dangling roots and multiple roots. (Our abstraction here has no problem representing trees with multiple roots, but they are not relevant to this task.)
childinds
extracts the child pointers which some of these results assume. This implementation assumes we are working with a binary tree (which is an explicit requirement of this task -- the parent node representation is far more general and can represent trees with any number of children at each node, but what would an "inorder" traversal look like with a trinary tree?).
Next, we define our "traversal" routines (actually, we are going a bit overboard here - we really only need to extract the data for this tasks's concept of traversal):
dataorder=: /:@data reorder ]
levelorder=: /:@depth@parent reorder ]
inorder=: inperm@parent reorder ]
inperm=:3 :0
chil=. childinds y
node=. {.I.(= i.@#) y
todo=. i.0 2
r=. i.0
whilst. (#todo)+.0<:node do.
if. 0 <: node do.
if. 0 <: {.ch=. node{chil do.
todo=. todo, node,{:ch
node=. {.ch
else.
r=. r, node
node=. _1 end.
else.
r=. r, {.ch=. {: todo
todo=. }: todo
node=. {:ch end. end.
r
)
postorder=: postperm@parent reorder ]
postperm=:3 :0
chil=. 0,1+childinds y
todo=. 1+I.(= i.@#) y
r=. i.0
whilst. (#todo) do.
node=. {: todo
todo=. }: todo
if. 0 < node do.
if. #ch=. (node{chil)-.0 do.
todo=. todo,(-node),|.ch
else.
r=. r, <:node end.
else.
r=. r, <:|node end. end.
)
preorder=: preperm@parent reorder ]
preperm=:3 :0
chil=. childinds y
todo=. I.(= i.@#) y
r=. i.0
whilst. (#todo) do.
r=. r,node=. {: todo
todo=. }: todo
if. #ch=. (node{chil)-._1 do.
todo=. todo,|.ch end. end.
r
)
These routines assume that children of a node are arranged so that the lower index appears to the left of the higher index. If instead we wanted to rely on the ordering of their values, we could first use dataorder
to enforce the assumption that child indexes are ordered properly.
Example use:
levelorder dataorder example
1 2 3 4 5 6 7 8 9
0 0 0 1 1 2 3 5 5
inorder dataorder example
7 4 2 5 1 8 6 9 3
1 2 4 2 4 6 8 6 4
preorder dataorder example
1 2 4 7 5 3 6 8 9
0 0 1 2 1 0 5 6 6
postorder dataorder example
7 4 5 2 8 9 6 3 1
1 3 3 8 6 6 7 8 8
(Once again, all we really need for this task is the first row of those results - the part that represents data.)
Java
Java: Procedural
This solution relies on a binary tree that allows null as left or right child nodes. Consequently, the traversal code has to check for null on each decent. The traversal variants are implemented within a monolithic switch statement.
import java.util.*;
public class TreeTraversal {
static class Node<T> {
T value;
Node<T> left;
Node<T> right;
Node(T value) {
this.value = value;
}
void visit() {
System.out.print(this.value + " ");
}
}
static enum ORDER {
PREORDER, INORDER, POSTORDER, LEVEL
}
static <T> void traverse(Node<T> node, ORDER order) {
if (node == null) {
return;
}
switch (order) {
case PREORDER:
node.visit();
traverse(node.left, order);
traverse(node.right, order);
break;
case INORDER:
traverse(node.left, order);
node.visit();
traverse(node.right, order);
break;
case POSTORDER:
traverse(node.left, order);
traverse(node.right, order);
node.visit();
break;
case LEVEL:
Queue<Node<T>> queue = new LinkedList<>();
queue.add(node);
while(!queue.isEmpty()){
Node<T> next = queue.remove();
next.visit();
if(next.left!=null)
queue.add(next.left);
if(next.right!=null)
queue.add(next.right);
}
}
}
public static void main(String[] args) {
Node<Integer> one = new Node<Integer>(1);
Node<Integer> two = new Node<Integer>(2);
Node<Integer> three = new Node<Integer>(3);
Node<Integer> four = new Node<Integer>(4);
Node<Integer> five = new Node<Integer>(5);
Node<Integer> six = new Node<Integer>(6);
Node<Integer> seven = new Node<Integer>(7);
Node<Integer> eight = new Node<Integer>(8);
Node<Integer> nine = new Node<Integer>(9);
one.left = two;
one.right = three;
two.left = four;
two.right = five;
three.left = six;
four.left = seven;
six.left = eight;
six.right = nine;
traverse(one, ORDER.PREORDER);
System.out.println();
traverse(one, ORDER.INORDER);
System.out.println();
traverse(one, ORDER.POSTORDER);
System.out.println();
traverse(one, ORDER.LEVEL);
}
}
Output:
1 2 4 7 5 3 6 8 9 7 4 2 5 1 8 6 9 3 7 4 5 2 8 9 6 3 1 1 2 3 4 5 6 7 8 9
Java: Object Oriented
This solution relies on a binary tree that distinguishes between ordinary and empty nodes. Therefore, the tree can be traversed using a visitor pattern that uses a polymorphic access method instead of null checks. The traversal variants are implemented as subclasses of a generic visitor. The action to be performed with each (non-empty) node is provided as function to the traversal algorithm.
import java.util.function.Consumer;
import java.util.Queue;
import java.util.LinkedList;
class TreeTraversal {
static class EmptyNode {
void accept(Visitor aVisitor) {}
void accept(LevelOrder aVisitor, Queue<EmptyNode> data) {}
}
static class Node<T> extends EmptyNode {
T data;
EmptyNode left = new EmptyNode();
EmptyNode right = new EmptyNode();
Node(T data) {
this.data = data;
}
Node<T> left(Node<?> aNode) {
this.left = aNode;
return this;
}
Node<T> right(Node<?> aNode) {
this.right = aNode;
return this;
}
void accept(Visitor aVisitor) {
aVisitor.visit(this);
}
void accept(LevelOrder aVisitor, Queue<EmptyNode> data) {
aVisitor.visit(this, data);
}
}
static abstract class Visitor {
Consumer<Node<?>> action;
Visitor(Consumer<Node<?>> action) {
this.action = action;
}
abstract <T> void visit(Node<T> aNode);
}
static class PreOrder extends Visitor {
PreOrder(Consumer<Node<?>> action) {
super(action);
}
<T> void visit(Node<T> aNode) {
action.accept(aNode);
aNode.left.accept(this);
aNode.right.accept(this);
}
}
static class InOrder extends Visitor {
InOrder(Consumer<Node<?>> action) {
super(action);
}
<T> void visit(Node<T> aNode) {
aNode.left.accept(this);
action.accept(aNode);
aNode.right.accept(this);
}
}
static class PostOrder extends Visitor {
PostOrder(Consumer<Node<?>> action) {
super(action);
}
<T> void visit(Node<T> aNode) {
aNode.left.accept(this);
aNode.right.accept(this);
action.accept(aNode);
}
}
static class LevelOrder extends Visitor {
LevelOrder(Consumer<Node<?>> action) {
super(action);
}
<T> void visit(Node<T> aNode) {
Queue<EmptyNode> queue = new LinkedList<>();
queue.add(aNode);
do {
queue.remove().accept(this, queue);
} while (!queue.isEmpty());
}
<T> void visit(Node<T> aNode, Queue<EmptyNode> queue) {
action.accept(aNode);
queue.add(aNode.left);
queue.add(aNode.right);
}
}
public static void main(String[] args) {
Node<Integer> tree = new Node<Integer>(1)
.left(new Node<Integer>(2)
.left(new Node<Integer>(4)
.left(new Node<Integer>(7)))
.right(new Node<Integer>(5)))
.right(new Node<Integer>(3)
.left(new Node<Integer>(6)
.left(new Node<Integer>(8))
.right(new Node<Integer>(9))));
Consumer<Node<?>> print = aNode -> System.out.print(aNode.data + " ");
tree.accept(new PreOrder(print));
System.out.println();
tree.accept(new InOrder(print));
System.out.println();
tree.accept(new PostOrder(print));
System.out.println();
tree.accept(new LevelOrder(print));
System.out.println();
}
}
Output:
1 2 4 7 5 3 6 8 9 7 4 2 5 1 8 6 9 3 7 4 5 2 8 9 6 3 1 1 2 3 4 5 6 7 8 9
JavaScript
ES5
Iteration
inspired by Ruby
function BinaryTree(value, left, right) {
this.value = value;
this.left = left;
this.right = right;
}
BinaryTree.prototype.preorder = function(f) {this.walk(f,['this','left','right'])}
BinaryTree.prototype.inorder = function(f) {this.walk(f,['left','this','right'])}
BinaryTree.prototype.postorder = function(f) {this.walk(f,['left','right','this'])}
BinaryTree.prototype.walk = function(func, order) {
for (var i in order)
switch (order[i]) {
case "this": func(this.value); break;
case "left": if (this.left) this.left.walk(func, order); break;
case "right": if (this.right) this.right.walk(func, order); break;
}
}
BinaryTree.prototype.levelorder = function(func) {
var queue = [this];
while (queue.length != 0) {
var node = queue.shift();
func(node.value);
if (node.left) queue.push(node.left);
if (node.right) queue.push(node.right);
}
}
// convenience function for creating a binary tree
function createBinaryTreeFromArray(ary) {
var left = null, right = null;
if (ary[1]) left = createBinaryTreeFromArray(ary[1]);
if (ary[2]) right = createBinaryTreeFromArray(ary[2]);
return new BinaryTree(ary[0], left, right);
}
var tree = createBinaryTreeFromArray([1, [2, [4, [7]], [5]], [3, [6, [8],[9]]]]);
print("*** preorder ***"); tree.preorder(print);
print("*** inorder ***"); tree.inorder(print);
print("*** postorder ***"); tree.postorder(print);
print("*** levelorder ***"); tree.levelorder(print);
Functional composition
(for binary trees consisting of nested lists)
(function () {
function preorder(n) {
return [n[v]].concat(
n[l] ? preorder(n[l]) : []
).concat(
n[r] ? preorder(n[r]) : []
);
}
function inorder(n) {
return (
n[l] ? inorder(n[l]) : []
).concat(
n[v]
).concat(
n[r] ? inorder(n[r]) : []
);
}
function postorder(n) {
return (
n[l] ? postorder(n[l]) : []
).concat(
n[r] ? postorder(n[r]) : []
).concat(
n[v]
);
}
function levelorder(n) {
return (function loop(x) {
return x.length ? (
x[0] ? (
[x[0][v]].concat(
loop(
x.slice(1).concat(
[x[0][l], x[0][r]]
)
)
)
) : loop(x.slice(1))
) : [];
})([n]);
}
var v = 0,
l = 1,
r = 2,
tree = [1,
[2,
[4,
[7]
],
[5]
],
[3,
[6,
[8],
[9]
]
]
],
lstTest = [["Traversal", "Nodes visited"]].concat(
[preorder, inorder, postorder, levelorder].map(
function (f) {
return [f.name, f(tree)];
}
)
);
// [[a]] -> bool -> s -> s
function wikiTable(lstRows, blnHeaderRow, strStyle) {
return '{| class="wikitable" ' + (
strStyle ? 'style="' + strStyle + '"' : ''
) + lstRows.map(function (lstRow, iRow) {
var strDelim = ((blnHeaderRow && !iRow) ? '!' : '|');
return '\n|-\n' + strDelim + ' ' + lstRow.map(function (v) {
return typeof v === 'undefined' ? ' ' : v;
}).join(' ' + strDelim + strDelim + ' ');
}).join('') + '\n|}';
}
return wikiTable(lstTest, true) + '\n\n' + JSON.stringify(lstTest);
})();
Output:
Traversal | Nodes visited |
---|---|
preorder | 1,2,4,7,5,3,6,8,9 |
inorder | 7,4,2,5,1,8,6,9,3 |
postorder | 7,4,5,2,8,9,6,3,1 |
levelorder | 1,2,3,4,5,6,7,8,9 |
[["Traversal","Nodes visited"],
["preorder",[1,2,4,7,5,3,6,8,9]],["inorder",[7,4,2,5,1,8,6,9,3]],
["postorder",[7,4,5,2,8,9,6,3,1]],["levelorder",[1,2,3,4,5,6,7,8,9]]]
or, again functionally, but:
- for a tree of nested dictionaries (rather than a simple nested list),
- defining a single traverse() function
- checking that the tree is indeed binary, and returning undefined for the in-order traversal if any node in the tree has more than two children. (The other 3 traversals are still defined for rose trees).
(function () {
'use strict';
// 'preorder' | 'inorder' | 'postorder' | 'level-order'
// traverse :: String -> Tree {value: a, nest: [Tree]} -> [a]
function traverse(strOrderName, dctTree) {
var strName = strOrderName.toLowerCase();
if (strName.startsWith('level')) {
// LEVEL-ORDER
return levelOrder([dctTree]);
} else if (strName.startsWith('in')) {
var lstNest = dctTree.nest;
if ((lstNest ? lstNest.length : 0) < 3) {
var left = lstNest[0] || [],
right = lstNest[1] || [],
lstLeft = left.nest ? (
traverse(strName, left)
) : (left.value || []),
lstRight = right.nest ? (
traverse(strName, right)
) : (right.value || []);
return (lstLeft !== undefined && lstRight !== undefined) ?
// IN-ORDER
(lstLeft instanceof Array ? lstLeft : [lstLeft])
.concat(dctTree.value)
.concat(lstRight) : undefined;
} else { // in-order only defined here for binary trees
return undefined;
}
} else {
var lstTraversed = concatMap(function (x) {
return traverse(strName, x);
}, (dctTree.nest || []));
return (
strName.startsWith('pre') ? (
// PRE-ORDER
[dctTree.value].concat(lstTraversed)
) : strName.startsWith('post') ? (
// POST-ORDER
lstTraversed.concat(dctTree.value)
) : []
);
}
}
// levelOrder :: [Tree {value: a, nest: [Tree]}] -> [a]
function levelOrder(lstTree) {
var lngTree = lstTree.length,
head = lngTree ? lstTree[0] : undefined,
tail = lstTree.slice(1);
// Recursively take any value found in the head node
// of the remaining tail, deferring any child nodes
// of that head to the end of the tail
return lngTree ? (
head ? (
[head.value].concat(
levelOrder(
tail
.concat(head.nest || [])
)
)
) : levelOrder(tail)
) : [];
}
// concatMap :: (a -> [b]) -> [a] -> [b]
function concatMap(f, xs) {
return [].concat.apply([], xs.map(f));
}
var dctTree = {
value: 1,
nest: [{
value: 2,
nest: [{
value: 4,
nest: [{
value: 7
}]
}, {
value: 5
}]
}, {
value: 3,
nest: [{
value: 6,
nest: [{
value: 8
}, {
value: 9
}]
}]
}]
};
return ['preorder', 'inorder', 'postorder', 'level-order']
.reduce(function (a, k) {
return (
a[k] = traverse(k, dctTree),
a
);
}, {});
})();
- Output:
{"preorder":[1, 2, 4, 7, 5, 3, 6, 8, 9],
"inorder":[7, 4, 2, 5, 1, 8, 6, 9, 3],
"postorder":[7, 4, 5, 2, 8, 9, 6, 3, 1],
"level-order":[1, 2, 3, 4, 5, 6, 7, 8, 9]}
ES6
In terms of general foldTree and levels functions:
(() => {
"use strict";
// preorder :: a -> [[a]] -> [a]
const preorder = x =>
xs => [x, ...xs.flat()];
// inorder :: a -> [[a]] -> [a]
const inorder = x =>
xs => Boolean(xs.length) ? (
[...xs[0], x, ...xs.slice(1).flat()]
) : [x];
// postorder :: a -> [[a]] -> [a]
const postorder = x =>
xs => [...xs.flat(), x];
// levelOrder :: Tree a -> [a]
const levelOrder = tree =>
levels(tree).flat();
// ------------------------TEST------------------------
// main :: IO ()
const main = () => {
const tree = Node(1)([
Node(2)([
Node(4)([
Node(7)([])
]),
Node(5)([])
]),
Node(3)([
Node(6)([
Node(8)([]),
Node(9)([])
])
])
]);
// Generated by code in Rosetta Code
// task: 'Visualize a tree'
console.log([
" + 4 - 7",
" + 2 ¦",
" ¦ + 5",
" 1 ¦",
" ¦ + 8",
" + 3 - 6 ¦",
" + 9"
].join("\n"));
[preorder, inorder, postorder]
.forEach(f => console.log(
justifyRight(11)(" ")(`${f.name}:`),
foldTree(f)(
tree
)
));
console.log(
`levelOrder: ${levelOrder(tree)}`
);
};
// ---------------------- TREES ----------------------
// Node :: a -> [Tree a] -> Tree a
const Node = v =>
// Constructor for a Tree node which connects a
// value of some kind to a list of zero or
// more child trees.
xs => ({
type: "Node",
root: v,
nest: xs || []
});
// foldTree :: (a -> [b] -> b) -> Tree a -> b
const foldTree = f => {
// The catamorphism on trees. A summary
// value obtained by a depth-first fold.
const go = tree => f(
tree.root
)(
tree.nest.map(go)
);
return go;
};
// levels :: Tree a -> [[a]]
const levels = tree => {
// A list of lists, grouping the root
// values of each level of the tree.
const go = (a, node) => {
const [h, ...t] = 0 < a.length ? a : [
[]
];
return [
[node.root, ...h],
...node.nest.reduceRight(go, t)
];
};
return go([], tree);
};
// --------------------- GENERIC ---------------------
// justifyRight :: Int -> Char -> String -> String
const justifyRight = n =>
// The string s, preceded by enough padding (with
// the character c) to reach the string length n.
c => s => Boolean(s) ? (
s.padStart(n, c)
) : "";
// MAIN ---
return main();
})();
- Output:
+ 4 - 7 + 2 ¦ ¦ + 5 1 ¦ ¦ + 8 + 3 - 6 ¦ + 9 preorder: 1,2,4,7,5,3,6,8,9 inorder: 7,4,2,5,1,8,6,9,3 postorder: 7,4,5,2,8,9,6,3,1 levelOrder: 1,2,3,4,5,6,7,8,9
jq
All the ordering filters defined here produce streams. For the final output, each stream is condensed into an array.
The implementation assumes an array structured recursively as [ node, left, right ], where "left" and "right" may be [] or null equivalently.
def preorder:
if length == 0 then empty
else .[0], (.[1]|preorder), (.[2]|preorder)
end;
def inorder:
if length == 0 then empty
else (.[1]|inorder), .[0] , (.[2]|inorder)
end;
def postorder:
if length == 0 then empty
else (.[1] | postorder), (.[2]|postorder), .[0]
end;
# Helper functions for levelorder:
# Produce a stream of the first elements
def heads: map( .[0] | select(. != null)) | .[];
# Produce a stream of the left/right branches:
def tails:
if length == 0 then empty
else [map ( .[1], .[2] ) | .[] | select( . != null)]
end;
def levelorder: [.] | recurse( tails ) | heads;
The task:
def task:
# [node, left, right]
def atree: [1, [2, [4, [7,[],[]],
[]],
[5, [],[]]],
[3, [6, [8,[],[]],
[9,[],[]]],
[]]] ;
"preorder: \( [atree|preorder ])",
"inorder: \( [atree|inorder ])",
"postorder: \( [atree|postorder ])",
"levelorder: \( [atree|levelorder])"
;
task
- Output:
$ jq -n -c -r -f Tree_traversal.jq preorder: [1,2,4,7,5,3,6,8,9] inorder: [7,4,2,5,1,8,6,9,3] postorder: [7,4,5,2,8,9,6,3,1] levelorder: [1,2,3,4,5,6,7,8,9]
Julia
tree = Any[1, Any[2, Any[4, Any[7, Any[],
Any[]],
Any[]],
Any[5, Any[],
Any[]]],
Any[3, Any[6, Any[8, Any[],
Any[]],
Any[9, Any[],
Any[]]],
Any[]]]
preorder(t, f) = if !isempty(t)
f(t[1]); preorder(t[2], f); preorder(t[3], f)
end
inorder(t, f) = if !isempty(t)
inorder(t[2], f); f(t[1]); inorder(t[3], f)
end
postorder(t, f) = if !isempty(t)
postorder(t[2], f); postorder(t[3], f); f(t[1])
end
levelorder(t, f) = while !isempty(t)
t = mapreduce(x -> isa(x, Number) ? (f(x); []) : x, vcat, t)
end
- Output:
julia> for f in [preorder, inorder, postorder, levelorder] print((lpad("$f: ", 12))); f(tree, x -> print(x, " ")); println() end preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 levelorder: 1 2 3 4 5 6 7 8 9
Kotlin
procedural style
data class Node(val v: Int, var left: Node? = null, var right: Node? = null) {
override fun toString() = "$v"
}
fun preOrder(n: Node?) {
n?.let {
print("$n ")
preOrder(n.left)
preOrder(n.right)
}
}
fun inorder(n: Node?) {
n?.let {
inorder(n.left)
print("$n ")
inorder(n.right)
}
}
fun postOrder(n: Node?) {
n?.let {
postOrder(n.left)
postOrder(n.right)
print("$n ")
}
}
fun levelOrder(n: Node?) {
n?.let {
val queue = mutableListOf(n)
while (queue.isNotEmpty()) {
val node = queue.removeAt(0)
print("$node ")
node.left?.let { queue.add(it) }
node.right?.let { queue.add(it) }
}
}
}
inline fun exec(name: String, n: Node?, f: (Node?) -> Unit) {
print(name)
f(n)
println()
}
fun main(args: Array<String>) {
val nodes = Array(10) { Node(it) }
nodes[1].left = nodes[2]
nodes[1].right = nodes[3]
nodes[2].left = nodes[4]
nodes[2].right = nodes[5]
nodes[4].left = nodes[7]
nodes[3].left = nodes[6]
nodes[6].left = nodes[8]
nodes[6].right = nodes[9]
exec(" preOrder: ", nodes[1], ::preOrder)
exec(" inorder: ", nodes[1], ::inorder)
exec(" postOrder: ", nodes[1], ::postOrder)
exec("level-order: ", nodes[1], ::levelOrder)
}
- Output:
preOrder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postOrder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
object-oriented style
fun main(args: Array<String>) {
data class Node(val v: Int, var left: Node? = null, var right: Node? = null) {
override fun toString() = " $v"
fun preOrder() { print(this); left?.preOrder(); right?.preOrder() }
fun inorder() { left?.inorder(); print(this); right?.inorder() }
fun postOrder() { left?.postOrder(); right?.postOrder(); print(this) }
fun levelOrder() = with(mutableListOf(this)) {
do {
val node = removeAt(0)
print(node)
node.left?.let { add(it) }
node.right?.let { add(it) }
} while (any())
}
inline fun exec(name: String, f: (Node) -> Unit) {
print(name)
f(this)
println()
}
}
val nodes = Array(10) { Node(it) }
nodes[1].left = nodes[2]
nodes[1].right = nodes[3]
nodes[2].left = nodes[4]
nodes[2].right = nodes[5]
nodes[4].left = nodes[7]
nodes[3].left = nodes[6]
nodes[6].left = nodes[8]
nodes[6].right = nodes[9]
with(nodes[1]) {
exec(" preOrder:", Node::preOrder)
exec(" inorder:", Node::inorder)
exec(" postOrder:", Node::postOrder)
exec("level-order:", Node::levelOrder)
}
}
Lambdatalk
Lambdatalk has primitives working on a word, sentences (sequences of words) and arrays:
- {W.equal? word1 word2} returns true or false - {S.replace rex by exp1 in exp2} replaces a regular expression by some expression in another one - {S.sort comp words} sorts the sequence of words according to comp - {A.new words} creates a new array from the sequence of words - {A.get index array} gets the value of array at index
{def walk
{def walk.r
{lambda {:o :t}
{if {W.equal? :t nil}
then
else {if {W.equal? :o preorder} then {A.get 0 :t} else}
{walk.r :order {A.get 1 :t}}
{if {W.equal? :o inorder} then {A.get 0 :t} else}
{walk.r :order {A.get 2 :t}}
{if {W.equal? :o postorder} then {A.get 0 :t} else} }}}
{lambda {:o :t}
{S.replace \s by space in {walk.r :o :t}}}}
{def sort
{lambda {:o :t} {S.sort :o {walk preorder :t}}}}
{def T
{A.new 1
{A.new 2
{A.new 4
{A.new 7 nil nil} nil}
{A.new 5 nil nil}}
{A.new 3
{A.new 6
{A.new 8 nil nil}
{A.new 9 nil nil}} nil}}}
{walk preorder {T}} -> 1 2 4 7 5 3 6 8 9
{walk inorder {T}} -> 7 4 2 5 1 8 6 9 3
{walk postorder {T}} -> 7 4 5 2 8 9 6 3 1
{sort < {T}} -> 1 2 3 4 5 6 7 8 9
{sort > {T}} -> 9 8 7 6 5 4 3 2 1
Lingo
-- parent script "BinaryTreeNode"
property _val, _left, _right
on new (me, val)
me._val = val
return me
end
on getValue (me)
return me._val
end
on setLeft (me, node)
me._left = node
end
on setRight (me, node)
me._right = node
end
on getLeft (me)
return me._left
end
on getRight (me)
return me._right
end
-- parent script "BinaryTreeTraversal"
on inOrder (me, node, l)
if voidP(l) then l = []
if voidP(node) then return l
if not voidP(node.getLeft()) then l = me.inOrder(node.getLeft(), l)
l.add(node)
if not voidP(node.getRight()) then l = me.inOrder(node.getRight(), l)
return l
end
on preOrder (me, node, l)
if voidP(l) then l = []
if voidP(node) then return l
l.add(node)
if not voidP(node.getLeft()) then l = me.preOrder(node.getLeft(), l)
if not voidP(node.getRight()) then l = me.preOrder(node.getRight(), l)
return l
end
on postOrder (me, node, l)
if voidP(l) then l = []
if voidP(node) then return l
if not voidP(node.getLeft()) then l = me.postOrder(node.getLeft(), l)
if not voidP(node.getRight()) then l = me.postOrder(node.getRight(), l)
l.add(node)
return l
end
on levelOrder (me, node)
l = []
queue = [node]
repeat while queue.count
node = queue[1]
queue.deleteAt(1)
l.add(node)
if not voidP(node.getLeft()) then queue.add(node.getLeft())
if not voidP(node.getRight()) then queue.add(node.getRight())
end repeat
return l
end
-- print utility function
on serialize (me, l)
str = ""
repeat with node in l
put node.getValue()&" " after str
end repeat
delete the last char of str
return str
end
Usage:
-- create the tree
l = []
repeat with i = 1 to 10
l[i] = script("BinaryTreeNode").new(i)
end repeat
l[6].setLeft (l[8])
l[6].setRight(l[9])
l[3].setLeft (l[6])
l[4].setLeft (l[7])
l[2].setLeft (l[4])
l[2].setRight(l[5])
l[1].setLeft (l[2])
l[1].setRight(l[3])
-- print traversal results
trav = script("BinaryTreeTraversal")
put "preorder: " & trav.serialize(trav.preOrder(l[1]))
put "inorder: " & trav.serialize(trav.inOrder(l[1]))
put "postorder: " & trav.serialize(trav.postOrder(l[1]))
put "level-order: " & trav.serialize(trav.levelOrder(l[1]))
- Output:
-- "preorder: 1 2 4 7 5 3 6 8 9" -- "inorder: 7 4 2 5 1 8 6 9 3" -- "postorder: 7 4 5 2 8 9 6 3 1" -- "level-order: 1 2 3 4 5 6 7 8 9"
Logo
; nodes are [data left right], use "first" to get data
to node.left :node
if empty? butfirst :node [output []]
output first butfirst :node
end
to node.right :node
if empty? butfirst :node [output []]
if empty? butfirst butfirst :node [output []]
output first butfirst butfirst :node
end
to max :a :b
output ifelse :a > :b [:a] [:b]
end
to tree.depth :tree
if empty? :tree [output 0]
output 1 + max tree.depth node.left :tree tree.depth node.right :tree
end
to pre.order :tree :action
if empty? :tree [stop]
invoke :action first :tree
pre.order node.left :tree :action
pre.order node.right :tree :action
end
to in.order :tree :action
if empty? :tree [stop]
in.order node.left :tree :action
invoke :action first :tree
in.order node.right :tree :action
end
to post.order :tree :action
if empty? :tree [stop]
post.order node.left :tree :action
post.order node.right :tree :action
invoke :action first :tree
end
to at.depth :n :tree :action
if empty? :tree [stop]
ifelse :n = 1 [invoke :action first :tree] [
at.depth :n-1 node.left :tree :action
at.depth :n-1 node.right :tree :action
]
end
to level.order :tree :action
for [i 1 [tree.depth :tree]] [at.depth :i :tree :action]
end
make "tree [1 [2 [4 [7]]
[5]]
[3 [6 [8]
[9]]]]
pre.order :tree [(type ? "| |)] (print)
in.order :tree [(type ? "| |)] (print)
post.order :tree [(type ? "| |)] (print)
level.order :tree [(type ? "| |)] (print)
Logtalk
:- object(tree_traversal).
:- public(orders/1).
orders(Tree) :-
write('Pre-order: '), pre_order(Tree), nl,
write('In-order: '), in_order(Tree), nl,
write('Post-order: '), post_order(Tree), nl,
write('Level-order: '), level_order(Tree).
:- public(orders/0).
orders :-
tree(Tree),
orders(Tree).
tree(
t(1,
t(2,
t(4,
t(7, t, t),
t
),
t(5, t, t)
),
t(3,
t(6,
t(8, t, t),
t(9, t, t)
),
t
)
)
).
pre_order(t).
pre_order(t(Value, Left, Right)) :-
write(Value), write(' '),
pre_order(Left),
pre_order(Right).
in_order(t).
in_order(t(Value, Left, Right)) :-
in_order(Left),
write(Value), write(' '),
in_order(Right).
post_order(t).
post_order(t(Value, Left, Right)) :-
post_order(Left),
post_order(Right),
write(Value), write(' ').
level_order(t).
level_order(t(Value, Left, Right)) :-
% write tree root value
write(Value), write(' '),
% write rest of the tree
level_order([Left, Right], Tail-Tail).
level_order([], Trees-[]) :-
( Trees \= [] ->
% print next level
level_order(Trees, Tail-Tail)
; % no more levels
true
).
level_order([Tree| Trees], Rest0) :-
( Tree = t(Value, Left, Right) ->
write(Value), write(' '),
% collect the subtrees to print the next level
append(Rest0, [Left, Right| Tail]-Tail, Rest1),
% continue printing the current level
level_order(Trees, Rest1)
; % continue printing the current level
level_order(Trees, Rest0)
).
% use difference-lists for constant time append
append(List1-Tail1, Tail1-Tail2, List1-Tail2).
:- end_object.
Sample output:
| ?- ?- tree_traversal::orders.
Pre-order: 1 2 4 7 5 3 6 8 9
In-order: 7 4 2 5 1 8 6 9 3
Post-order: 7 4 5 2 8 9 6 3 1
Level-order: 1 2 3 4 5 6 7 8 9
yes
Lua
local function depth_first(tr, a, b, c, flat_list)
for _, val in ipairs({a, b, c}) do
if type(tr[val]) == "table" then
depth_first(tr[val], a, b, c, flat_list)
elseif type(tr[val]) ~= "nil" then
table.insert(flat_list, tr[val])
end -- if
end -- for
return flat_list
end
local function flatten_pre_order(tr) return depth_first(tr, 1, 2, 3, {}) end
local function flatten_in_order(tr) return depth_first(tr, 2, 1, 3, {}) end
local function flatten_post_order(tr) return depth_first(tr, 2, 3, 1, {}) end
local function flatten_level_order(tr)
local flat_list, queue = {}, {tr}
while next(queue) do -- while queue is not empty
local node = table.remove(queue, 1) -- dequeue
if type(node) == "table" then
table.insert(flat_list, node[1])
table.insert(queue, node[2]) -- enqueue
table.insert(queue, node[3]) -- enqueue
else
table.insert(flat_list, node)
end -- if
end -- while
return flat_list
end
-- Example
local tree = {1, {2, {4, 7}, 5}, {3, {6, 8, 9}}}
print("Pre order: " .. table.concat(flatten_pre_order(tree), " "))
print("In order: " .. table.concat(flatten_in_order(tree), " "))
print("Post order: " .. table.concat(flatten_post_order(tree), " "))
print("Level order: " .. table.concat(flatten_level_order(tree), " "))
M2000 Interpreter
Using Tuple as Tree
A tuple is an "auto array" in M2000 Interpreter. (,) is the zero length array.
Module CheckIt {
Null=(,)
Tree=((((Null,7,Null),4,Null),2,(Null,5,Null)),1,(((Null,8,Null),6,(Null,9,Null)),3,Null))
Module preorder (T) {
Print "preorder: ";
printtree(T)
Print
sub printtree(T)
Print T#val(1);" ";
If len(T#val(0))>0 then printtree(T#val(0))
If len(T#val(2))>0 then printtree(T#val(2))
end sub
}
preorder Tree
Module inorder (T) {
Print "inorder: ";
printtree(T)
Print
sub printtree(T)
If len(T#val(0))>0 then printtree(T#val(0))
Print T#val(1);" ";
If len(T#val(2))>0 then printtree(T#val(2))
end sub
}
inorder Tree
Module postorder (T) {
Print "postorder: ";
printtree(T)
Print
sub printtree(T)
If len(T#val(0))>0 then printtree(T#val(0))
If len(T#val(2))>0 then printtree(T#val(2))
Print T#val(1);" ";
end sub
}
postorder Tree
Module level_order (T) {
Print "level-order: ";
Stack New {
printtree(T)
if empty then exit
Read T
Loop
}
Print
sub printtree(T)
If Len(T)>0 then
Print T#val(1);" ";
Data T#val(0), T#val(2)
end if
end sub
}
level_order Tree
}
CheckIt
Using OOP
Now tree is nodes with pointers to nodes (a node ifs a Group, the user object) The "as pointer" is optional, but we can use type check if we want.
Module OOP {
\\ Class is a global function (until this module end)
Class Null {
}
\\ Null is a pointer to an object returned from class Null()
Global Null->Null()
Class Node {
Public:
x, Group LeftNode, Group RightNode
Class:
\\ after class: anything exist one time,
\\ not included in final object
Module Node {
.LeftNode<=Null
.RightNode<=Null
Read .x
\\ read ? for optional values
Read ? .LeftNode, .RightNode
}
}
\\ NodeTree return a pointer to a new Node
Function NodeTree {
\\ ![] pass currrent stack to Node()
->Node(![])
}
Tree=NodeTree(1, NodeTree(2,NodeTree(4, NodeTree(7)), NodeTree(5)), NodeTree(3, NodeTree(6, NodeTree(8), NodeTree(9))))
Module preorder (T) {
Print "preorder: ";
printtree(T)
Print
sub printtree(T as pointer)
If T is Null then Exit sub
Print T=>x;" ";
printtree(T=>LeftNode)
printtree(T=>RightNode)
end sub
}
preorder Tree
Module inorder (T) {
Print "inorder: ";
printtree(T)
Print
sub printtree(T as pointer)
If T is Null then Exit sub
printtree(T=>LeftNode)
Print T=>x;" ";
printtree(T=>RightNode)
end sub
}
inorder Tree
Module postorder (T) {
Print "postorder: ";
printtree(T)
Print
sub printtree(T as pointer)
If T is Null then Exit sub
printtree(T=>LeftNode)
printtree(T=>RightNode)
Print T=>x;" ";
end sub
}
postorder Tree
Module level_order (T) {
Print "level-order: ";
Stack New {
printtree(T)
if empty then exit
Read T
Loop
}
Print
sub printtree(T as pointer)
If T is Null else
Print T=>x;" ";
Data T=>LeftNode, T=>RightNode
end if
end sub
}
level_order Tree
}
OOP
or we can put modules inside Node Class as methods also i put a visitor as a call back (a lambda function called as module)
Module OOP {
\\ Class is a global function (until this module end)
Class Null {
}
\\ Null is a pointer to an object returned from class Null()
Global Null->Null()
Class Node {
Public:
x, Group LeftNode, Group RightNode
Module preorder (visitor){
T->This
printtree(T)
sub printtree(T as pointer)
If T is Null then Exit sub
call visitor(T=>x)
printtree(T=>LeftNode)
printtree(T=>RightNode)
end sub
}
Module inorder (visitor){
T->This
printtree(T)
sub printtree(T as pointer)
If T is Null then Exit sub
printtree(T=>LeftNode)
call visitor(T=>x)
printtree(T=>RightNode)
end sub
}
Module postorder (visitor) {
T->This
printtree(T)
sub printtree(T as pointer)
If T is Null then Exit sub
printtree(T=>LeftNode)
printtree(T=>RightNode)
call visitor(T=>x)
end sub
}
Module level_order (visitor){
T->This
Stack New {
printtree(T)
if empty then exit
Read T
Loop
}
sub printtree(T as pointer)
If T is Null else
call visitor(T=>x)
Data T=>LeftNode, T=>RightNode
end if
end sub
}
Class:
\\ after class: anything exist one time,
\\ not included in final object
Module Node {
.LeftNode<=Null
.RightNode<=Null
Read .x
\\ read ? for optional values
Read ? .LeftNode, .RightNode
}
}
\\ NodeTree return a pointer to a new Node
Function NodeTree {
\\ ![] pass currrent stack to Node()
->Node(![])
}
Tree=NodeTree(1, NodeTree(2,NodeTree(4, NodeTree(7)), NodeTree(5)), NodeTree(3, NodeTree(6, NodeTree(8), NodeTree(9))))
printnum=lambda (title$) -> {
Print
Print title$;
=lambda (x)-> {
Print x;" ";
}
}
Tree=>preorder printnum("preorder: ")
Tree=>inorder printnum("inorder: ")
Tree=>postorder printnum("postorder: ")
Tree=>level_order printnum("level-order: ")
}
OOP
Using Event object as visitor
Module OOP {
\\ Class is a global function (until this module end)
Class Null {
}
\\ Null is a pointer to an object returned from class Null()
Global Null->Null()
Class Node {
Public:
x, Group LeftNode, Group RightNode
Module preorder (visitor){
T->This
printtree(T)
sub printtree(T as pointer)
If T is Null then Exit sub
call event visitor, T=>x
printtree(T=>LeftNode)
printtree(T=>RightNode)
end sub
}
Module inorder (visitor){
T->This
printtree(T)
sub printtree(T as pointer)
If T is Null then Exit sub
printtree(T=>LeftNode)
call event visitor, T=>x
printtree(T=>RightNode)
end sub
}
Module postorder (visitor) {
T->This
printtree(T)
sub printtree(T as pointer)
If T is Null then Exit sub
printtree(T=>LeftNode)
printtree(T=>RightNode)
call event visitor, T=>x
end sub
}
Module level_order (visitor){
T->This
Stack New {
printtree(T)
if empty then exit
Read T
Loop
}
sub printtree(T as pointer)
If T is Null else
call event visitor, T=>x
Data T=>LeftNode, T=>RightNode
end if
end sub
}
Class:
\\ after class: anything exist one time,
\\ not included in final object
Module Node {
.LeftNode<=Null
.RightNode<=Null
Read .x
\\ read ? for optional values
Read ? .LeftNode, .RightNode
}
}
\\ NodeTree return a pointer to a new Node
Function NodeTree {
\\ ![] pass currrent stack to Node()
->Node(![])
}
Tree=NodeTree(1, NodeTree(2,NodeTree(4, NodeTree(7)), NodeTree(5)), NodeTree(3, NodeTree(6, NodeTree(8), NodeTree(9))))
Event PrintAnum {
read x
}
Function PrintThis(x) {
Print x;" ";
}
Event PrintAnum New PrintThis()
printnum=lambda PrintAnum (title$) -> {
Print
Print title$;
=PrintAnum
}
Tree=>preorder printnum("preorder: ")
Tree=>inorder printnum("inorder: ")
Tree=>postorder printnum("postorder: ")
Tree=>level_order printnum("level-order: ")
}
OOP
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
Mathematica /Wolfram Language
preorder[a_Integer] := a;
preorder[a_[b__]] := Flatten@{a, preorder /@ {b}};
inorder[a_Integer] := a;
inorder[a_[b_, c_]] := Flatten@{inorder@b, a, inorder@c};
inorder[a_[b_]] := Flatten@{inorder@b, a}; postorder[a_Integer] := a;
postorder[a_[b__]] := Flatten@{postorder /@ {b}, a};
levelorder[a_] :=
Flatten[Table[Level[a, {n}], {n, 0, Depth@a}]] /. {b_Integer[__] :>
b};
Example:
preorder[1[2[4[7], 5], 3[6[8, 9]]]]
inorder[1[2[4[7], 5], 3[6[8, 9]]]]
postorder[1[2[4[7], 5], 3[6[8, 9]]]]
levelorder[1[2[4[7], 5], 3[6[8, 9]]]]
- Output:
{1, 2, 4, 7, 5, 3, 6, 8, 9} {7, 4, 2, 5, 1, 8, 6, 9, 3} {7, 4, 5, 2, 8, 9, 6, 3, 1} {1, 2, 3, 4, 5, 6, 7, 8, 9}
Mercury
:- module tree_traversal.
:- interface.
:- import_module io.
:- pred main(io::di, io::uo) is det.
:- implementation.
:- import_module list.
:- type tree(V)
---> empty
; node(V, tree(V), tree(V)).
:- pred preorder(pred(V, A, A), tree(V), A, A).
:- mode preorder(pred(in, di, uo) is det, in, di, uo) is det.
preorder(_, empty, !Acc).
preorder(P, node(Value, Left, Right), !Acc) :-
P(Value, !Acc),
preorder(P, Left, !Acc),
preorder(P, Right, !Acc).
:- pred inorder(pred(V, A, A), tree(V), A, A).
:- mode inorder(pred(in, di, uo) is det, in, di, uo) is det.
inorder(_, empty, !Acc).
inorder(P, node(Value, Left, Right), !Acc) :-
inorder(P, Left, !Acc),
P(Value, !Acc),
inorder(P, Right, !Acc).
:- pred postorder(pred(V, A, A), tree(V), A, A).
:- mode postorder(pred(in, di, uo) is det, in, di, uo) is det.
postorder(_, empty, !Acc).
postorder(P, node(Value, Left, Right), !Acc) :-
postorder(P, Left, !Acc),
postorder(P, Right, !Acc),
P(Value, !Acc).
:- pred levelorder(pred(V, A, A), tree(V), A, A).
:- mode levelorder(pred(in, di, uo) is det, in, di, uo) is det.
levelorder(P, Tree, !Acc) :-
do_levelorder(P, [Tree], !Acc).
:- pred do_levelorder(pred(V, A, A), list(tree(V)), A, A).
:- mode do_levelorder(pred(in, di, uo) is det, in, di, uo) is det.
do_levelorder(_, [], !Acc).
do_levelorder(P, [empty | Xs], !Acc) :-
do_levelorder(P, Xs, !Acc).
do_levelorder(P, [node(Value, Left, Right) | Xs], !Acc) :-
P(Value, !Acc),
do_levelorder(P, Xs ++ [Left, Right], !Acc).
:- func tree = tree(int).
tree =
node(1,
node(2,
node(4,
node(7, empty, empty),
empty
),
node(5, empty, empty)
),
node(3,
node(6,
node(8, empty, empty),
node(9, empty, empty)
),
empty
)
).
main(!IO) :-
io.write_string("preorder: " ,!IO),
preorder(print_value, tree, !IO), io.nl(!IO),
io.write_string("inorder: " ,!IO),
inorder(print_value, tree, !IO), io.nl(!IO),
io.write_string("postorder: " ,!IO),
postorder(print_value, tree, !IO), io.nl(!IO),
io.write_string("levelorder: " ,!IO),
levelorder(print_value, tree, !IO), io.nl(!IO).
:- pred print_value(V::in, io::di, io::uo) is det.
print_value(V, !IO) :-
io.print(V, !IO),
io.write_string(" ", !IO).
Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 levelorder: 1 2 3 4 5 6 7 8 9
Miranda
main :: [sys_message]
main = [Stdout (lay [show (f example)
| f <- [preorder,inorder,postorder,levelorder]])]
example :: tree num
example = Node 1 (Node 2 (Node 4 (leaf 7) Nilt)
(leaf 5))
(Node 3 (Node 6 (leaf 8) (leaf 9)) Nilt)
tree * ::= Nilt | Node * (tree *) (tree *)
leaf :: *->tree *
leaf k = Node k Nilt Nilt
preorder :: tree *->[*]
preorder Nilt = []
preorder (Node v l r) = v : preorder l ++ preorder r
inorder :: tree *->[*]
inorder Nilt = []
inorder (Node v l r) = inorder l ++ v : inorder r
postorder :: tree *->[*]
postorder Nilt = []
postorder (Node v l r) = postorder l ++ postorder r ++ [v]
levelorder :: tree *->[*]
levelorder t = f [t]
where f [] = []
f (Nilt:xs) = f xs
f (Node v l r:xs) = v : f (xs++[l,r])
- Output:
[1,2,4,7,5,3,6,8,9] [7,4,2,5,1,8,6,9,3] [7,4,5,2,8,9,6,3,1] [1,2,3,4,5,6,7,8,9]
Nim
import deques
type
Node[T] = ref object
data: T
left, right: Node[T]
proc newNode[T](data: T; left, right: Node[T] = nil): Node[T] =
Node[T](data: data, left: left, right: right)
proc preorder[T](n: Node[T]): seq[T] =
if n.isNil: @[]
else: @[n.data] & preorder(n.left) & preorder(n.right)
proc inorder[T](n: Node[T]): seq[T] =
if n.isNil: @[]
else: inorder(n.left) & @[n.data] & inorder(n.right)
proc postorder[T](n: Node[T]): seq[T] =
if n.isNil: @[]
else: postorder(n.left) & postorder(n.right) & @[n.data]
proc levelorder[T](n: Node[T]): seq[T] =
var queue: Deque[Node[T]]
queue.addLast(n)
while queue.len > 0:
let next = queue.popFirst()
result.add next.data
if not next.left.isNil: queue.addLast(next.left)
if not next.right.isNil: queue.addLast(next.right)
let tree = 1.newNode(
2.newNode(
4.newNode(
7.newNode),
5.newNode),
3.newNode(
6.newNode(
8.newNode,
9.newNode)))
echo preorder tree
echo inorder tree
echo postorder tree
echo levelorder tree
- Output:
@[1, 2, 4, 7, 5, 3, 6, 8, 9] @[7, 4, 2, 5, 1, 8, 6, 9, 3] @[7, 4, 5, 2, 8, 9, 6, 3, 1] @[1, 2, 3, 4, 5, 6, 7, 8, 9]
Objeck
??use Collection;
class Test {
function : Main(args : String[]) ~ Nil {
one := Node->New(1);
two := Node->New(2);
three := Node->New(3);
four := Node->New(4);
five := Node->New(5);
six := Node->New(6);
seven := Node->New(7);
eight := Node->New(8);
nine := Node->New(9);
one->SetLeft(two); one->SetRight(three);
two->SetLeft(four); two->SetRight(five);
three->SetLeft(six); four->SetLeft(seven);
six->SetLeft(eight); six->SetRight(nine);
"Preorder: "->Print(); Preorder(one);
"\nInorder: "->Print(); Inorder(one);
"\nPostorder: "->Print(); Postorder(one);
"\nLevelorder: "->Print(); Levelorder(one);
"\n"->Print();
}
function : Preorder(node : Node) ~ Nil {
if(node <> Nil) {
System.IO.Console->Print(node->GetData())->Print(", ");
Preorder(node->GetLeft());
Preorder(node->GetRight());
};
}
function : Inorder(node : Node) ~ Nil {
if(node <> Nil) {
Inorder(node->GetLeft());
System.IO.Console->Print(node->GetData())->Print(", ");
Inorder(node->GetRight());
};
}
function : Postorder(node : Node) ~ Nil {
if(node <> Nil) {
Postorder(node->GetLeft());
Postorder(node->GetRight());
System.IO.Console->Print(node->GetData())->Print(", ");
};
}
function : Levelorder(node : Node) ~ Nil {
nodequeue := Collection.Queue->New();
if(node <> Nil) {
nodequeue->Add(node);
};
while(nodequeue->IsEmpty() = false) {
next := nodequeue->Remove()->As(Node);
System.IO.Console->Print(next->GetData())->Print(", ");
if(next->GetLeft() <> Nil) {
nodequeue->Add(next->GetLeft());
};
if(next->GetRight() <> Nil) {
nodequeue->Add(next->GetRight());
};
};
}
}
class Node from BasicCompare {
@left : Node;
@right : Node;
@data : Int;
New(data : Int) {
Parent();
@data := data;
}
method : public : GetData() ~ Int {
return @data;
}
method : public : SetLeft(left : Node) ~ Nil {
@left := left;
}
method : public : GetLeft() ~ Node {
return @left;
}
method : public : SetRight(right : Node) ~ Nil {
@right := right;
}
method : public : GetRight() ~ Node {
return @right;
}
method : public : Compare(rhs : Compare) ~ Int {
right : Node := rhs->As(Node);
if(@data = right->GetData()) {
return 0;
}
else if(@data < right->GetData()) {
return -1;
};
return 1;
}
}
Output:
Preorder: 1, 2, 4, 7, 5, 3, 6, 8, 9, Inorder: 7, 4, 2, 5, 1, 8, 6, 9, 3, Postorder: 7, 4, 5, 2, 8, 9, 6, 3, 1, Levelorder: 1, 2, 3, 4, 5, 6, 7, 8, 9,
OCaml
type 'a tree = Empty
| Node of 'a * 'a tree * 'a tree
let rec preorder f = function
Empty -> ()
| Node (v,l,r) -> f v;
preorder f l;
preorder f r
let rec inorder f = function
Empty -> ()
| Node (v,l,r) -> inorder f l;
f v;
inorder f r
let rec postorder f = function
Empty -> ()
| Node (v,l,r) -> postorder f l;
postorder f r;
f v
let levelorder f x =
let queue = Queue.create () in
Queue.add x queue;
while not (Queue.is_empty queue) do
match Queue.take queue with
Empty -> ()
| Node (v,l,r) -> f v;
Queue.add l queue;
Queue.add r queue
done
let tree =
Node (1,
Node (2,
Node (4,
Node (7, Empty, Empty),
Empty),
Node (5, Empty, Empty)),
Node (3,
Node (6,
Node (8, Empty, Empty),
Node (9, Empty, Empty)),
Empty))
let () =
preorder (Printf.printf "%d ") tree; print_newline ();
inorder (Printf.printf "%d ") tree; print_newline ();
postorder (Printf.printf "%d ") tree; print_newline ();
levelorder (Printf.printf "%d ") tree; print_newline ()
Output:
1 2 4 7 5 3 6 8 9 7 4 2 5 1 8 6 9 3 2 4 7 5 3 6 8 9 1 1 2 3 4 5 6 7 8 9
Oforth
Object Class new: Tree(v, l, r)
Tree method: initialize(v, l, r) v := v l := l r := r ;
Tree method: v @v ;
Tree method: l @l ;
Tree method: r @r ;
Tree method: preOrder(f)
@v f perform
@l ifNotNull: [ @l preOrder(f) ]
@r ifNotNull: [ @r preOrder(f) ] ;
Tree method: inOrder(f)
@l ifNotNull: [ @l inOrder(f) ]
@v f perform
@r ifNotNull: [ @r inOrder(f) ] ;
Tree method: postOrder(f)
@l ifNotNull: [ @l postOrder(f) ]
@r ifNotNull: [ @r postOrder(f) ]
@v f perform ;
Tree method: levelOrder(f)
| c n |
Channel new self over send drop ->c
while(c notEmpty) [
c receive ->n
n v f perform
n l dup ifNotNull: [ c send ] drop
n r dup ifNotNull: [ c send ] drop
] ;
- Output:
>Tree new(3, Tree new(6, Tree new(8, null, null), Tree new(9, null, null)), null) ok >Tree new(2, Tree new(4, Tree new(7, null, null), null), Tree new(5, null, null)) ok >1 Tree new ok > ok >dup preOrder(#.) 1 2 4 7 5 3 6 8 9 ok >dup inOrder(#.) 7 4 2 5 1 8 6 9 3 ok >dup postOrder(#.) 7 4 5 2 8 9 6 3 1 ok >dup levelOrder(#.) 1 2 3 4 5 6 7 8 9 ok
ooRexx
one = .Node~new(1);
two = .Node~new(2);
three = .Node~new(3);
four = .Node~new(4);
five = .Node~new(5);
six = .Node~new(6);
seven = .Node~new(7);
eight = .Node~new(8);
nine = .Node~new(9);
one~left = two
one~right = three
two~left = four
two~right = five
three~left = six
four~left = seven
six~left = eight
six~right = nine
out = .array~new
.treetraverser~preorder(one, out);
say "Preorder: " out~toString("l", ", ")
out~empty
.treetraverser~inorder(one, out);
say "Inorder: " out~toString("l", ", ")
out~empty
.treetraverser~postorder(one, out);
say "Postorder: " out~toString("l", ", ")
out~empty
.treetraverser~levelorder(one, out);
say "Levelorder:" out~toString("l", ", ")
::class node
::method init
expose left right data
use strict arg data
left = .nil
right = .nil
::attribute left
::attribute right
::attribute data
::class treeTraverser
::method preorder class
use arg node, out
if node \== .nil then do
out~append(node~data)
self~preorder(node~left, out)
self~preorder(node~right, out)
end
::method inorder class
use arg node, out
if node \== .nil then do
self~inorder(node~left, out)
out~append(node~data)
self~inorder(node~right, out)
end
::method postorder class
use arg node, out
if node \== .nil then do
self~postorder(node~left, out)
self~postorder(node~right, out)
out~append(node~data)
end
::method levelorder class
use arg node, out
if node == .nil then return
nodequeue = .queue~new
nodequeue~queue(node)
loop while \nodequeue~isEmpty
next = nodequeue~pull
out~append(next~data)
if next~left \= .nil then
nodequeue~queue(next~left)
if next~right \= .nil then
nodequeue~queue(next~right)
end
Output:
Preorder: 1, 2, 4, 7, 5, 3, 6, 8, 9 Inorder: 7, 4, 2, 5, 1, 8, 6, 9, 3 Postorder: 7, 4, 5, 2, 8, 9, 6, 3, 1 Levelorder: 1, 2, 3, 4, 5, 6, 7, 8, 9
Oz
declare
Tree = n(1
n(2
n(4 n(7 e e) e)
n(5 e e))
n(3
n(6 n(8 e e) n(9 e e))
e))
fun {Concat Xs}
{FoldR Xs Append nil}
end
fun {Preorder T}
case T of e then nil
[] n(V L R) then
{Concat [[V]
{Preorder L}
{Preorder R}]}
end
end
fun {Inorder T}
case T of e then nil
[] n(V L R) then
{Concat [{Inorder L}
[V]
{Inorder R}]}
end
end
fun {Postorder T}
case T of e then nil
[] n(V L R) then
{Concat [{Postorder L}
{Postorder R}
[V]]}
end
end
local
fun {Collect Queue}
case Queue of nil then nil
[] e|Xr then {Collect Xr}
[] n(V L R)|Xr then
V|{Collect {Append Xr [L R]}}
end
end
in
fun {Levelorder T}
{Collect [T]}
end
end
in
{Show {Preorder Tree}}
{Show {Inorder Tree}}
{Show {Postorder Tree}}
{Show {Levelorder Tree}}
PascalABC.NET
type
Node<T> = auto class
data: T;
left,right: Node<T>;
end;
function ND<T>(data: T; left: Node<T> := nil; right: Node<T> := nil)
:= new Node<T>(data,left,right);
procedure Prefix<T>(r: Node<T>);
begin
if r = nil then
exit;
Print(r.data);
Prefix(r.left);
Prefix(r.right);
end;
procedure Infix<T>(r: Node<T>);
begin
if r = nil then
exit;
Infix(r.left);
Print(r.data);
Infix(r.right);
end;
procedure Postfix<T>(r: Node<T>);
begin
if r = nil then
exit;
Postfix(r.left);
Postfix(r.right);
Print(r.data);
end;
procedure LevelOrder<T>(r: Node<T>);
begin
if r = nil then
exit;
var q := new Queue<Node<T>>;
q.Enqueue(r);
while q.Count > 0 do
begin
var x := q.Dequeue;
Print(x.data);
if x.left <> nil then
q.Enqueue(x.Left);
if x.Right <> nil then
q.Enqueue(x.Right);
end;
end;
begin
var root := ND(1,ND(2,ND(4,ND(7)),ND(5)),ND(3,ND(6,ND(8),ND(9))));
Println(root);
Prefix(root); Println;
Infix(root); Println;
Postfix(root); Println;
LevelOrder(root); Println;
end.
- Output:
(1,(2,(4,(7,nil,nil),nil),(5,nil,nil)),(3,(6,(8,nil,nil),(9,nil,nil)),nil)) 1 2 4 7 5 3 6 8 9 7 4 2 5 1 8 6 9 3 7 4 5 2 8 9 6 3 1 1 2 3 4 5 6 7 8 9
Perl
Tree nodes are represented by 3-element arrays: [0] - the value; [1] - left child; [2] - right child.
sub preorder
{
my $t = shift or return ();
return ($t->[0], preorder($t->[1]), preorder($t->[2]));
}
sub inorder
{
my $t = shift or return ();
return (inorder($t->[1]), $t->[0], inorder($t->[2]));
}
sub postorder
{
my $t = shift or return ();
return (postorder($t->[1]), postorder($t->[2]), $t->[0]);
}
sub depth
{
my @ret;
my @a = ($_[0]);
while (@a) {
my $v = shift @a or next;
push @ret, $v->[0];
push @a, @{$v}[1,2];
}
return @ret;
}
my $x = [1,[2,[4,[7]],[5]],[3,[6,[8],[9]]]];
print "pre: @{[preorder($x)]}\n";
print "in: @{[inorder($x)]}\n";
print "post: @{[postorder($x)]}\n";
print "depth: @{[depth($x)]}\n";
Output:
pre: 1 2 4 7 5 3 6 8 9 in: 7 4 2 5 1 8 6 9 3 post: 7 4 5 2 8 9 6 3 1 depth: 1 2 3 4 5 6 7 8 9
Phix
Copy of Euphoria. This is included in the distribution as demo\rosetta\Tree_traversal.exw, which also contains a way to build such a nested structure, and thirdly a "flat list of nodes" tree, that allows more interesting options such as a tag sort.
constant VALUE = 1, LEFT = 2, RIGHT = 3 constant tree = {1, {2, {4, {7, 0, 0}, 0}, {5, 0, 0}}, {3, {6, {8, 0, 0}, {9, 0, 0}}, 0}} procedure preorder(object tree) if sequence(tree) then printf(1,"%d ",{tree[VALUE]}) preorder(tree[LEFT]) preorder(tree[RIGHT]) end if end procedure procedure inorder(object tree) if sequence(tree) then inorder(tree[LEFT]) printf(1,"%d ",{tree[VALUE]}) inorder(tree[RIGHT]) end if end procedure procedure postorder(object tree) if sequence(tree) then postorder(tree[LEFT]) postorder(tree[RIGHT]) printf(1,"%d ",{tree[VALUE]}) end if end procedure procedure level_order(object tree, sequence more = {}) if sequence(tree) then more &= {tree[LEFT],tree[RIGHT]} printf(1,"%d ",{tree[VALUE]}) end if if length(more) > 0 then level_order(more[1],more[2..$]) end if end procedure puts(1,"\n preorder: ") preorder(tree) puts(1,"\n inorder: ") inorder(tree) puts(1,"\n postorder: ") postorder(tree) puts(1,"\n level-order: ") level_order(tree)
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
PHP
class Node {
private $left;
private $right;
private $value;
function __construct($value) {
$this->value = $value;
}
public function getLeft() {
return $this->left;
}
public function getRight() {
return $this->right;
}
public function getValue() {
return $this->value;
}
public function setLeft($value) {
$this->left = $value;
}
public function setRight($value) {
$this->right = $value;
}
public function setValue($value) {
$this->value = $value;
}
}
class TreeTraversal {
public function preOrder(Node $n) {
echo $n->getValue() . " ";
if($n->getLeft() != null) {
$this->preOrder($n->getLeft());
}
if($n->getRight() != null){
$this->preOrder($n->getRight());
}
}
public function inOrder(Node $n) {
if($n->getLeft() != null) {
$this->inOrder($n->getLeft());
}
echo $n->getValue() . " ";
if($n->getRight() != null){
$this->inOrder($n->getRight());
}
}
public function postOrder(Node $n) {
if($n->getLeft() != null) {
$this->postOrder($n->getLeft());
}
if($n->getRight() != null){
$this->postOrder($n->getRight());
}
echo $n->getValue() . " ";
}
public function levelOrder($arg) {
$q[] = $arg;
while (!empty($q)) {
$n = array_shift($q);
echo $n->getValue() . " ";
if($n->getLeft() != null) {
$q[] = $n->getLeft();
}
if($n->getRight() != null){
$q[] = $n->getRight();
}
}
}
}
$arr = [];
for ($i=1; $i < 10; $i++) {
$arr[$i] = new Node($i);
}
$arr[6]->setLeft($arr[8]);
$arr[6]->setRight($arr[9]);
$arr[3]->setLeft($arr[6]);
$arr[4]->setLeft($arr[7]);
$arr[2]->setLeft($arr[4]);
$arr[2]->setRight($arr[5]);
$arr[1]->setLeft($arr[2]);
$arr[1]->setRight($arr[3]);
$tree = new TreeTraversal($arr);
echo "preorder:\t";
$tree->preOrder($arr[1]);
echo "\ninorder:\t";
$tree->inOrder($arr[1]);
echo "\npostorder:\t";
$tree->postOrder($arr[1]);
echo "\nlevel-order:\t";
$tree->levelOrder($arr[1]);
Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
PicoLisp
(de preorder (Node Fun)
(when Node
(Fun (car Node))
(preorder (cadr Node) Fun)
(preorder (caddr Node) Fun) ) )
(de inorder (Node Fun)
(when Node
(inorder (cadr Node) Fun)
(Fun (car Node))
(inorder (caddr Node) Fun) ) )
(de postorder (Node Fun)
(when Node
(postorder (cadr Node) Fun)
(postorder (caddr Node) Fun)
(Fun (car Node)) ) )
(de level-order (Node Fun)
(for (Q (circ Node) Q)
(let N (fifo 'Q)
(Fun (car N))
(and (cadr N) (fifo 'Q @))
(and (caddr N) (fifo 'Q @)) ) ) )
(setq *Tree
(1
(2 (4 (7)) (5))
(3 (6 (8) (9))) ) )
(for Order '(preorder inorder postorder level-order)
(prin (align -13 (pack Order ":")))
(Order *Tree printsp)
(prinl) )
Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
Prolog
Works with SWI-Prolog.
tree :-
Tree= [1,
[2,
[4,
[7, nil, nil],
nil],
[5, nil, nil]],
[3,
[6,
[8, nil, nil],
[9,nil, nil]],
nil]],
write('preorder : '), preorder(Tree), nl,
write('inorder : '), inorder(Tree), nl,
write('postorder : '), postorder(Tree), nl,
write('level-order : '), level_order([Tree]).
preorder(nil).
preorder([Node, FG, FD]) :-
format('~w ', [Node]),
preorder(FG),
preorder(FD).
inorder(nil).
inorder([Node, FG, FD]) :-
inorder(FG),
format('~w ', [Node]),
inorder(FD).
postorder(nil).
postorder([Node, FG, FD]) :-
postorder(FG),
postorder(FD),
format('~w ', [Node]).
level_order([]).
level_order(A) :-
level_order_(A, U-U, S),
level_order(S).
level_order_([], S-[],S).
level_order_([[Node, FG, FD] | T], CS, FS) :-
format('~w ', [Node]),
append_dl(CS, [FG, FD|U]-U, CS1),
level_order_(T, CS1, FS).
level_order_([nil | T], CS, FS) :-
level_order_(T, CS, FS).
append_dl(X-Y, Y-Z, X-Z).
Output :
?- tree. preorder : 1 2 4 7 5 3 6 8 9 inorder : 7 4 2 5 1 8 6 9 3 postorder : 7 4 5 2 8 9 6 3 1 level-order : 1 2 3 4 5 6 7 8 9 true .
PureBasic
Structure node
value.i
*left.node
*right.node
EndStructure
Structure queue
List q.i()
EndStructure
DataSection
tree:
Data.s "1(2(4(7),5),3(6(8,9)))"
EndDataSection
;Convenient routine to interpret string data to construct a tree of integers.
Procedure createTree(*n.node, *tPtr.Character)
Protected num.s, *l.node, *ntPtr.Character
Repeat
Select *tPtr\c
Case '0' To '9'
num + Chr(*tPtr\c)
Case '('
*n\value = Val(num): num = ""
*ntPtr = *tPtr + 1
If *ntPtr\c = ','
ProcedureReturn *tPtr
Else
*l = AllocateMemory(SizeOf(node))
*n\left = *l: *tPtr = createTree(*l, *ntPtr)
EndIf
Case ')', ',', #Null
If num: *n\value = Val(num): EndIf
ProcedureReturn *tPtr
EndSelect
If *tPtr\c = ','
*l = AllocateMemory(SizeOf(node)):
*n\right = *l: *tPtr = createTree(*l, *tPtr + 1)
EndIf
*tPtr + 1
ForEver
EndProcedure
Procedure enqueue(List q.i(), element)
LastElement(q())
AddElement(q())
q() = element
EndProcedure
Procedure dequeue(List q.i())
Protected element
If FirstElement(q())
element = q()
DeleteElement(q())
EndIf
ProcedureReturn element
EndProcedure
Procedure onVisit(*n.node)
Print(Str(*n\value) + " ")
EndProcedure
Procedure preorder(*n.node) ;recursive
onVisit(*n)
If *n\left
preorder(*n\left)
EndIf
If *n\right
preorder(*n\right)
EndIf
EndProcedure
Procedure inorder(*n.node) ;recursive
If *n\left
inorder(*n\left)
EndIf
onVisit(*n)
If *n\right
inorder(*n\right)
EndIf
EndProcedure
Procedure postorder(*n.node) ;recursive
If *n\left
postorder(*n\left)
EndIf
If *n\right
postorder(*n\right)
EndIf
onVisit(*n)
EndProcedure
Procedure levelorder(*n.node)
Dim q.queue(1)
Protected readQueue = 1, writeQueue, *currNode.node
enqueue(q(writeQueue)\q(),*n) ;start queue off with root
Repeat
readQueue ! 1: writeQueue ! 1
While ListSize(q(readQueue)\q())
*currNode = dequeue(q(readQueue)\q())
If *currNode\left
enqueue(q(writeQueue)\q(),*currNode\left)
EndIf
If *currNode\right
enqueue(q(writeQueue)\q(),*currNode\right)
EndIf
onVisit(*currNode)
Wend
Until ListSize(q(writeQueue)\q()) = 0
EndProcedure
If OpenConsole()
Define root.node
createTree(root,?tree)
Print("preorder: ")
preorder(root)
PrintN("")
Print("inorder: ")
inorder(root)
PrintN("")
Print("postorder: ")
postorder(root)
PrintN("")
Print("levelorder: ")
levelorder(root)
PrintN("")
Print(#CRLF$ + #CRLF$ + "Press ENTER to exit")
Input()
CloseConsole()
EndIf
Sample output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 levelorder: 1 2 3 4 5 6 7 8 9
Python
Python: Procedural
from collections import namedtuple
Node = namedtuple('Node', 'data, left, right')
tree = Node(1,
Node(2,
Node(4,
Node(7, None, None),
None),
Node(5, None, None)),
Node(3,
Node(6,
Node(8, None, None),
Node(9, None, None)),
None))
def printwithspace(i):
print(i, end=' ')
def dfs(order, node, visitor):
if node is not None:
for action in order:
if action == 'N':
visitor(node.data)
elif action == 'L':
dfs(order, node.left, visitor)
elif action == 'R':
dfs(order, node.right, visitor)
def preorder(node, visitor = printwithspace):
dfs('NLR', node, visitor)
def inorder(node, visitor = printwithspace):
dfs('LNR', node, visitor)
def postorder(node, visitor = printwithspace):
dfs('LRN', node, visitor)
def ls(node, more, visitor, order='TB'):
"Level-based Top-to-Bottom or Bottom-to-Top tree search"
if node:
if more is None:
more = []
more += [node.left, node.right]
for action in order:
if action == 'B' and more:
ls(more[0], more[1:], visitor, order)
elif action == 'T' and node:
visitor(node.data)
def levelorder(node, more=None, visitor = printwithspace):
ls(node, more, visitor, 'TB')
# Because we can
def reverse_preorder(node, visitor = printwithspace):
dfs('RLN', node, visitor)
def bottom_up_order(node, more=None, visitor = printwithspace, order='BT'):
ls(node, more, visitor, 'BT')
if __name__ == '__main__':
w = 10
for traversal in [preorder, inorder, postorder, levelorder,
reverse_preorder, bottom_up_order]:
if traversal == reverse_preorder:
w = 20
print('\nThe generalisation of function dfs allows:')
if traversal == bottom_up_order:
print('The generalisation of function ls allows:')
print(f"{traversal.__name__:>{w}}:", end=' ')
traversal(tree)
print()
Sample output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 levelorder: 1 2 3 4 5 6 7 8 9 The generalisation of function dfs allows: reverse_preorder: 9 8 6 3 5 7 4 2 1 The generalisation of function ls allows: bottom_up_order: 9 8 7 6 5 4 3 2 1
Python: Class based
Subclasses a namedtuple adding traversal methods that apply a visitor function to data at nodes of the tree in order
from collections import namedtuple
from sys import stdout
class Node(namedtuple('Node', 'data, left, right')):
__slots__ = ()
def preorder(self, visitor):
if self is not None:
visitor(self.data)
Node.preorder(self.left, visitor)
Node.preorder(self.right, visitor)
def inorder(self, visitor):
if self is not None:
Node.inorder(self.left, visitor)
visitor(self.data)
Node.inorder(self.right, visitor)
def postorder(self, visitor):
if self is not None:
Node.postorder(self.left, visitor)
Node.postorder(self.right, visitor)
visitor(self.data)
def levelorder(self, visitor, more=None):
if self is not None:
if more is None:
more = []
more += [self.left, self.right]
visitor(self.data)
if more:
Node.levelorder(more[0], visitor, more[1:])
def printwithspace(i):
stdout.write("%i " % i)
tree = Node(1,
Node(2,
Node(4,
Node(7, None, None),
None),
Node(5, None, None)),
Node(3,
Node(6,
Node(8, None, None),
Node(9, None, None)),
None))
if __name__ == '__main__':
stdout.write(' preorder: ')
tree.preorder(printwithspace)
stdout.write('\n inorder: ')
tree.inorder(printwithspace)
stdout.write('\n postorder: ')
tree.postorder(printwithspace)
stdout.write('\nlevelorder: ')
tree.levelorder(printwithspace)
stdout.write('\n')
- Output:
As above.
Python: Composition of pure (curried) functions
Currying by default is probably not particularly 'Pythonic', but it does work well with higher-order functions – giving us more flexibility in compositional structure. It also often protects us from over-proliferation of the slightly noisy lambda keyword. (See for example the use of the curried version of map in the code below).
The approach taken here is to focus on the evaluation of expressions, rather than the sequencing of procedures. To keep evaluation simple and easily rearranged, mutation is stripped back wherever possible, and 'pure' functions, with inputs and outputs but, ideally, with no side-effects (and no sensitivities to global variables) are the basic building-block.
Composing pure functions also works well with library-building and code reuse – the literature on functional programming (particularly in the ML / OCaml / Haskell tradition) is rich in reusable abstractions for our toolkit. Some of them have already been absorbed, with standard or adjusted names, into the Python itertools module. (See the itertools module preface, and the takewhile function below).
Here, for example, for the pre-, in- and post- orders, we can define a very general and reusable foldTree (a catamorphism over trees rather than lists) and just pass 3 different (rather simple) sequencing functions to it.
This level of abstraction and reuse brings real efficiencies – the short and easily-written foldTree, for example, doesn't just traverse and list contents in flexible orders - we can pass any kind of accumulation or tree-transformation to it.
'''Tree traversals'''
from itertools import chain
from functools import reduce
from operator import mul
# foldTree :: (a -> [b] -> b) -> Tree a -> b
def foldTree(f):
'''The catamorphism on trees. A summary
value defined by a depth-first fold.
'''
def go(node):
return f(root(node))([
go(x) for x in nest(node)
])
return go
# levels :: Tree a -> [[a]]
def levels(tree):
'''A list of lists, grouping the root
values of each level of the tree.
'''
def go(a, node):
h, *t = a if a else ([], [])
return [[root(node)] + h] + reduce(
go, nest(node)[::-1], t
)
return go([], tree)
# preorder :: a -> [[a]] -> [a]
def preorder(x):
'''This node followed by the rest.'''
return lambda xs: [x] + concat(xs)
# inorder :: a -> [[a]] -> [a]
def inorder(x):
'''Descendants of any first child,
then this node, then the rest.'''
return lambda xs: (
xs[0] + [x] + concat(xs[1:]) if xs else [x]
)
# postorder :: a -> [[a]] -> [a]
def postorder(x):
'''Descendants first, then this node.'''
return lambda xs: concat(xs) + [x]
# levelorder :: Tree a -> [a]
def levelorder(tree):
'''Top-down concatenation of this node
with the rows below.'''
return concat(levels(tree))
# treeSum :: Int -> [Int] -> Int
def treeSum(x):
'''This node's value + the sum of its descendants.'''
return lambda xs: x + sum(xs)
# treeProduct :: Int -> [Int] -> Int
def treeProduct(x):
'''This node's value * the product of its descendants.'''
return lambda xs: x * numericProduct(xs)
# treeMax :: Ord a => a -> [a] -> a
def treeMax(x):
'''Maximum value of this node and any descendants.'''
return lambda xs: max([x] + xs)
# treeMin :: Ord a => a -> [a] -> a
def treeMin(x):
'''Minimum value of this node and any descendants.'''
return lambda xs: min([x] + xs)
# nodeCount :: Int -> [Int] -> Int
def nodeCount(_):
'''One more than the total number of descendants.'''
return lambda xs: 1 + sum(xs)
# treeWidth :: Int -> [Int] -> Int
def treeWidth(_):
'''Sum of widths of any children, or a minimum of 1.'''
return lambda xs: sum(xs) if xs else 1
# treeDepth :: Int -> [Int] -> Int
def treeDepth(_):
'''One more than that of the deepest child.'''
return lambda xs: 1 + (max(xs) if xs else 0)
# ------------------------- TEST -------------------------
# main :: IO ()
def main():
'''Tree traversals - accumulating and folding'''
# tree :: Tree Int
tree = Node(1)([
Node(2)([
Node(4)([
Node(7)([])
]),
Node(5)([])
]),
Node(3)([
Node(6)([
Node(8)([]),
Node(9)([])
])
])
])
print(
fTable(main.__doc__ + ':\n')(fName)(str)(
lambda f: (
foldTree(f) if 'levelorder' != fName(f) else f
)(tree)
)([
preorder, inorder, postorder, levelorder,
treeSum, treeProduct, treeMin, treeMax,
nodeCount, treeWidth, treeDepth
])
)
# ----------------------- GENERIC ------------------------
# Node :: a -> [Tree a] -> Tree a
def Node(v):
'''Contructor for a Tree node which connects a
value of some kind to a list of zero or
more child trees.'''
return lambda xs: {
'type': 'Node', 'root': v, 'nest': xs
}
# nest :: Tree a -> [Tree a]
def nest(tree):
'''Accessor function for children of tree node'''
return tree['nest'] if 'nest' in tree else None
# root :: Dict -> a
def root(tree):
'''Accessor function for data of tree node'''
return tree['root'] if 'root' in tree else None
# concat :: [[a]] -> [a]
# concat :: [String] -> String
def concat(xxs):
'''The concatenation of all the elements in a list.'''
xs = list(chain.from_iterable(xxs))
unit = '' if isinstance(xs, str) else []
return unit if not xs else (
''.join(xs) if isinstance(xs[0], str) else xs
)
# numericProduct :: [Num] -> Num
def numericProduct(xs):
'''The arithmetic product of all numbers in xs.'''
return reduce(mul, xs, 1)
# ---------------------- FORMATTING ----------------------
# fName :: (a -> b) -> String
def fName(f):
'''The name bound to the function.'''
return f.__name__
# fTable :: String -> (a -> String) ->
# (b -> String) ->
# (a -> b) -> [a] -> String
def fTable(s):
'''Heading -> x display function ->
fx display function -> f -> xs -> tabular string.
'''
def go(xShow, fxShow, f, xs):
ys = [xShow(x) for x in xs]
w = max(map(len, ys))
return s + '\n' + '\n'.join(map(
lambda x, y: y.rjust(w, ' ') + (
' -> ' + fxShow(f(x))
),
xs, ys
))
return lambda xShow: lambda fxShow: (
lambda f: lambda xs: go(
xShow, fxShow, f, xs
)
)
if __name__ == '__main__':
main()
- Output:
Tree traversals - accumulating and folding: preorder -> [1, 2, 4, 7, 5, 3, 6, 8, 9] inorder -> [7, 4, 2, 5, 1, 8, 6, 9, 3] postorder -> [7, 4, 5, 2, 8, 9, 6, 3, 1] levelorder -> [1, 2, 3, 4, 5, 6, 7, 8, 9] treeSum -> 45 treeProduct -> 362880 treeMin -> 1 treeMax -> 9 nodeCount -> 9 treeWidth -> 4 treeDepth -> 4
Qi
(set *tree* [1 [2 [4 [7]]
[5]]
[3 [6 [8]
[9]]]])
(define inorder
[] -> []
[V] -> [V]
[V L] -> (append (inorder L)
[V])
[V L R] -> (append (inorder L)
[V]
(inorder R)))
(define postorder
[] -> []
[V] -> [V]
[V L] -> (append (postorder L)
[V])
[V L R] -> (append (postorder L)
(postorder R)
[V]))
(define preorder
[] -> []
[V] -> [V]
[V L] -> (append [V]
(preorder L))
[V L R] -> (append [V]
(preorder L)
(preorder R)))
(define levelorder-0
[] -> []
[[] | Q] -> (levelorder-0 Q)
[[V | LR] | Q] -> [V | (levelorder-0 (append Q LR))])
(define levelorder
Node -> (levelorder-0 [Node]))
(preorder (value *tree*))
(postorder (value *tree*))
(inorder (value *tree*))
(levelorder (value *tree*))
Output:
[1 2 4 7 5 3 6 8 9] [7 4 2 5 1 8 6 9 3] [7 4 5 2 8 9 6 3 1] [1 2 3 4 5 6 7 8 9]
Quackery
Requires the words at Queue/Definition#Quackery for level-order
.
[ this ] is nil ( --> [ )
[ ' [ 1
[ 2
[ 4
[ 7 nil nil ]
nil ]
[ 5 nil nil ] ]
[ 3
[ 6
[ 8 nil nil ]
[ 9 nil nil ] ]
nil ] ] ] is tree ( --> [ )
[ dup nil = iff drop done
unpack swap rot
echo sp
recurse
recurse ] is pre-order ( [ --> )
[ dup nil = iff drop done
unpack unrot
recurse
echo sp
recurse ] is in-order ( [ --> )
[ dup nil = iff drop done
unpack swap
recurse
recurse
echo sp ] is post-order ( [ --> )
[ queue swap push
[ dup empty?
iff drop done
pop
dup nil = iff
drop again
unpack
rot echo sp
dip push push
again ] ] is level-order ( [ --> )
tree pre-order cr
tree in-order cr
tree post-order cr
tree level-order cr
- Output:
1 2 4 7 5 3 6 8 9 7 4 2 5 1 8 6 9 3 7 4 5 2 8 9 6 3 1 1 2 3 4 5 6 7 8 9
Racket
#lang racket
(define the-tree ; Node: (list <data> <left> <right>)
'(1 (2 (4 (7 #f #f) #f) (5 #f #f)) (3 (6 (8 #f #f) (9 #f #f)) #f)))
(define (preorder tree visit)
(let loop ([t tree])
(when t (visit (car t)) (loop (cadr t)) (loop (caddr t)))))
(define (inorder tree visit)
(let loop ([t tree])
(when t (loop (cadr t)) (visit (car t)) (loop (caddr t)))))
(define (postorder tree visit)
(let loop ([t tree])
(when t (loop (cadr t)) (loop (caddr t)) (visit (car t)))))
(define (levelorder tree visit)
(let loop ([trees (list tree)])
(unless (null? trees)
((compose1 loop (curry filter values) append*)
(for/list ([t trees] #:when t) (visit (car t)) (cdr t))))))
(define (run order)
(printf "~a:" (object-name order))
(order the-tree (?(x) (printf " ~s" x)))
(newline))
(for-each run (list preorder inorder postorder levelorder))
Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 levelorder: 1 2 3 4 5 6 7 8 9
Raku
(formerly Perl 6)
class TreeNode {
has TreeNode $.parent;
has TreeNode $.left;
has TreeNode $.right;
has $.value;
method pre-order {
flat gather {
take $.value;
take $.left.pre-order if $.left;
take $.right.pre-order if $.right
}
}
method in-order {
flat gather {
take $.left.in-order if $.left;
take $.value;
take $.right.in-order if $.right;
}
}
method post-order {
flat gather {
take $.left.post-order if $.left;
take $.right.post-order if $.right;
take $.value;
}
}
method level-order {
my TreeNode @queue = (self);
flat gather while @queue.elems {
my $n = @queue.shift;
take $n.value;
@queue.push($n.left) if $n.left;
@queue.push($n.right) if $n.right;
}
}
}
my TreeNode $root .= new( value => 1,
left => TreeNode.new( value => 2,
left => TreeNode.new( value => 4, left => TreeNode.new(value => 7)),
right => TreeNode.new( value => 5)
),
right => TreeNode.new( value => 3,
left => TreeNode.new( value => 6,
left => TreeNode.new(value => 8),
right => TreeNode.new(value => 9)
)
)
);
say "preorder: ",$root.pre-order.join(" ");
say "inorder: ",$root.in-order.join(" ");
say "postorder: ",$root.post-order.join(" ");
say "levelorder:",$root.level-order.join(" ");
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 levelorder:1 2 3 4 5 6 7 8 9
REBOL
tree: [1 [2 [4 [7 [] []] []] [5 [] []]] [3 [6 [8 [] []] [9 [] []]] []]]
; "compacted" version
tree: [1 [2 [4 [7 ] ] [5 ]] [3 [6 [8 ] [9 ]] ]]
visit: func [tree [block!]][prin rejoin [first tree " "]]
left: :second
right: :third
preorder: func [tree [block!]][
if not empty? tree [visit tree]
attempt [preorder left tree]
attempt [preorder right tree]
]
prin "preorder: " preorder tree
print ""
inorder: func [tree [block!]][
attempt [inorder left tree]
if not empty? tree [visit tree]
attempt [inorder right tree]
]
prin "inorder: " inorder tree
print ""
postorder: func [tree [block!]][
attempt [postorder left tree]
attempt [postorder right tree]
if not empty? tree [visit tree]
]
prin "postorder: " postorder tree
print ""
queue: []
enqueue: func [tree [block!]][append/only queue tree]
dequeue: func [queue [block!]][take queue]
level-order: func [tree [block!]][
clear head queue
queue: enqueue tree
while [not empty? queue] [
tree: dequeue queue
if not empty? tree [visit tree]
attempt [enqueue left tree]
attempt [enqueue right tree]
]
]
prin "level-order: " level-order tree
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
Refal
$ENTRY Go {
= <Show Preorder <Tree>>
<Show Inorder <Tree>>
<Show Postorder <Tree>>
<Show Levelorder <Tree>>;
};
Show {
s.F t.T = <Prout s.F ': ' <Mu s.F t.T>>;
};
Tree {
= (1 (2 (4 (7 () ()) ()) (5 () ())) (3 (6 (8 () ()) (9 () ())) ()));
};
Preorder {
() = ;
(s.V t.L t.R) = s.V <Preorder t.L> <Preorder t.R>;
};
Inorder {
() = ;
(s.V t.L t.R) = <Inorder t.L> s.V <Inorder t.R>;
};
Postorder {
() = ;
(s.V t.L t.R) = <Postorder t.L> <Postorder t.R> s.V;
};
Levelorder {
= ;
() e.Q = <Levelorder e.Q>;
(s.V t.L t.R) e.Q = s.V <Levelorder e.Q t.L t.R>;
};
- Output:
Preorder : 1 2 4 7 5 3 6 8 9 Inorder : 7 4 2 5 1 8 6 9 3 Postorder : 7 4 5 2 8 9 6 3 1 Levelorder : 1 2 3 4 5 6 7 8 9
REXX
/* REXX ***************************************************************
* Tree traversal
= 1
= / \
= / \
= / \
= 2 3
= / \ /
= 4 5 6
= / / \
= 7 8 9
=
= The correct output should look like this:
= preorder: 1 2 4 7 5 3 6 8 9
= level-order: 1 2 3 4 5 6 7 8 9
= postorder: 7 4 5 2 8 9 6 3 1
= inorder: 7 4 2 5 1 8 6 9 3
* 17.06.2012 Walter Pachl not thoroughly tested
**********************************************************************/
debug=0
wl_soll=1 2 4 7 5 3 6 8 9
il_soll=7 4 2 5 1 8 6 9 3
pl_soll=7 4 5 2 8 9 6 3 1
ll_soll=1 2 3 4 5 6 7 8 9
Call mktree
wl.=''; wl='' /* preorder */
ll.=''; ll='' /* level-order */
il='' /* inorder */
pl='' /* postorder */
/**********************************************************************
* First walk the tree and construct preorder and level-order lists
**********************************************************************/
done.=0
lvl=1
z=root
Call note z
Do Until z=0
z=go_next(z)
Call note z
End
Call show 'preorder: ',wl,wl_soll
Do lvl=1 To 4
ll=ll ll.lvl
End
Call show 'level-order:',ll,ll_soll
/**********************************************************************
* Next construct postorder list
**********************************************************************/
done.=0
ridone.=0
z=lbot(root)
Call notep z
Do Until z=0
br=brother(z)
If br>0 &,
done.br=0 Then Do
ridone.br=1
z=lbot(br)
Call notep z
End
Else
z=father(z)
Call notep z
End
Call show 'postorder: ',pl,pl_soll
/**********************************************************************
* Finally construct inorder list
**********************************************************************/
done.=0
ridone.=0
z=lbot(root)
Call notei z
Do Until z=0
z=father(z)
Call notei z
ri=node.z.0rite
If ridone.z=0 Then Do
ridone.z=1
If ri>0 Then Do
z=lbot(ri)
Call notei z
End
End
End
/**********************************************************************
* And now show the results and check them for correctness
**********************************************************************/
Call show 'inorder: ',il,il_soll
Exit
show: Parse Arg Which,have,soll
/**********************************************************************
* Show our result and show it it's correct
**********************************************************************/
have=space(have)
If have=soll Then
tag=''
Else
tag='*wrong*'
Say which have tag
If tag<>'' Then
Say '------------>'soll 'is the expected result'
Return
brother: Procedure Expose node.
/**********************************************************************
* Return the right node of this node's father or 0
**********************************************************************/
Parse arg no
nof=node.no.0father
brot1=node.nof.0rite
Return brot1
notei: Procedure Expose debug il done.
/**********************************************************************
* append the given node to il
**********************************************************************/
Parse Arg nd
If nd<>0 &,
done.nd=0 Then
il=il nd
If debug Then
Say 'notei' nd
done.nd=1
Return
notep: Procedure Expose debug pl done.
/**********************************************************************
* append the given node to pl
**********************************************************************/
Parse Arg nd
If nd<>0 &,
done.nd=0 Then Do
pl=pl nd
If debug Then
Say 'notep' nd
End
done.nd=1
Return
father: Procedure Expose node.
/**********************************************************************
* Return the father of the argument
* or 0 if the root is given as argument
**********************************************************************/
Parse Arg nd
Return node.nd.0father
lbot: Procedure Expose node.
/**********************************************************************
* From node z: Walk down on the left side until you reach the bottom
* and return the bottom node
* If z has no left son (at the bottom of the tree) returm itself
**********************************************************************/
Parse Arg z
Do i=1 To 100
If node.z.0left<>0 Then
z=node.z.0left
Else
Leave
End
Return z
note:
/**********************************************************************
* add the node to the preorder list unless it's already there
* add the node to the level list
**********************************************************************/
If z<>0 &, /* it's a node */
done.z=0 Then Do /* not yet done */
wl=wl z /* add it to the preorder list*/
ll.lvl=ll.lvl z /* add it to the level list */
done.z=1 /* remember it's done */
End
Return
go_next: Procedure Expose node. lvl
/**********************************************************************
* find the next node to visit in the treewalk
**********************************************************************/
next=0
Parse arg z
If node.z.0left<>0 Then Do /* there is a left son */
If node.z.0left.done=0 Then Do /* we have not visited it */
next=node.z.0left /* so we go there */
node.z.0left.done=1 /* note we were here */
lvl=lvl+1 /* increase the level */
End
End
If next=0 Then Do /* not moved yet */
If node.z.0rite<>0 Then Do /* there is a right son */
If node.z.0rite.done=0 Then Do /* we have not visited it */
next=node.z.0rite /* so we go there */
node.z.0rite.done=1 /* note we were here */
lvl=lvl+1 /* increase the level */
End
End
End
If next=0 Then Do /* not moved yet */
next=node.z.0father /* go to the father */
lvl=lvl-1 /* decrease the level */
End
Return next /* that's the next node */
/* or zero if we are done */
mknode: Procedure Expose node.
/**********************************************************************
* create a new node
**********************************************************************/
Parse Arg name
z=node.0+1
node.z.0name=name
node.z.0father=0
node.z.0left =0
node.z.0rite =0
node.0=z
Return z /* number of the node just created */
attleft: Procedure Expose node.
/**********************************************************************
* make son the left son of father
**********************************************************************/
Parse Arg son,father
node.son.0father=father
z=node.father.0left
If z<>0 Then Do
node.z.0father=son
node.son.0left=z
End
node.father.0left=son
Return
attrite: Procedure Expose node.
/**********************************************************************
* make son the right son of father
**********************************************************************/
Parse Arg son,father
node.son.0father=father
z=node.father.0rite
If z<>0 Then Do
node.z.0father=son
node.son.0rite=z
End
node.father.0rite=son
le=node.father.0left
If le>0 Then
node.le.0brother=node.father.0rite
Return
mktree: Procedure Expose node. root
/**********************************************************************
* build the tree according to the task
**********************************************************************/
node.=0
a=mknode('A'); root=a
b=mknode('B'); Call attleft b,a
c=mknode('C'); Call attrite c,a
d=mknode('D'); Call attleft d,b
e=mknode('E'); Call attrite e,b
f=mknode('F'); Call attleft f,c
g=mknode('G'); Call attleft g,d
h=mknode('H'); Call attleft h,f
i=mknode('I'); Call attrite i,f
Call show_tree 1
Return
show_tree: Procedure Expose node.
/**********************************************************************
* Show the tree
* f
* l1 1 r1
* l r l r
* l r l r l r l r
* 12345678901234567890
**********************************************************************/
Parse Arg f
l.=''
l.1=overlay(f ,l.1, 9)
l1=node.f.0left ;l.2=overlay(l1 ,l.2, 5)
/*b1=node.f.0brother ;l.2=overlay(b1 ,l.2, 9) */
r1=node.f.0rite ;l.2=overlay(r1 ,l.2,13)
l1g=node.l1.0left ;l.3=overlay(l1g ,l.3, 3)
/*b1g=node.l1.0brother ;l.3=overlay(b1g ,l.3, 5) */
r1g=node.l1.0rite ;l.3=overlay(r1g ,l.3, 7)
l2g=node.r1.0left ;l.3=overlay(l2g ,l.3,11)
/*b2g=node.r1.0brother ;l.3=overlay(b2g ,l.3,13) */
r2g=node.r1.0rite ;l.3=overlay(r2g ,l.3,15)
l1ls=node.l1g.0left ;l.4=overlay(l1ls,l.4, 2)
/*b1ls=node.l1g.0brother ;l.4=overlay(b1ls,l.4, 3) */
r1ls=node.l1g.0rite ;l.4=overlay(r1ls,l.4, 4)
l1rs=node.r1g.0left ;l.4=overlay(l1rs,l.4, 6)
/*b1rs=node.r1g.0brother ;l.4=overlay(b1rs,l.4, 7) */
r1rs=node.r1g.0rite ;l.4=overlay(r1rs,l.4, 8)
l2ls=node.l2g.0left ;l.4=overlay(l2ls,l.4,10)
/*b2ls=node.l2g.0brother ;l.4=overlay(b2ls,l.4,11) */
r2ls=node.l2g.0rite ;l.4=overlay(r2ls,l.4,12)
l2rs=node.r2g.0left ;l.4=overlay(l2rs,l.4,14)
/*b2rs=node.r2g.0brother ;l.4=overlay(b2rs,l.4,15) */
r2rs=node.r2g.0rite ;l.4=overlay(r2rs,l.4,16)
Do i=1 To 4
Say translate(l.i,' ','0')
Say ''
End
Return
- Output:
1 2 3 4 5 6 7 8 9 preorder: 1 2 4 7 5 3 6 8 9 level-order: 1 2 3 4 5 6 7 8 9 postorder: 7 4 5 2 8 9 6 3 1 inorder: 7 4 2 5 1 8 6 9 3
Ruby
BinaryTreeNode = Struct.new(:value, :left, :right) do
def self.from_array(nested_list)
value, left, right = nested_list
if value
self.new(value, self.from_array(left), self.from_array(right))
end
end
def walk_nodes(order, &block)
order.each do |node|
case node
when :left then left && left.walk_nodes(order, &block)
when :self then yield self
when :right then right && right.walk_nodes(order, &block)
end
end
end
def each_preorder(&b) walk_nodes([:self, :left, :right], &b) end
def each_inorder(&b) walk_nodes([:left, :self, :right], &b) end
def each_postorder(&b) walk_nodes([:left, :right, :self], &b) end
def each_levelorder
queue = [self]
until queue.empty?
node = queue.shift
yield node
queue << node.left if node.left
queue << node.right if node.right
end
end
end
root = BinaryTreeNode.from_array [1, [2, [4, 7], [5]], [3, [6, [8], [9]]]]
BinaryTreeNode.instance_methods.select{|m| m=~/.+order/}.each do |mthd|
printf "%-11s ", mthd[5..-1] + ':'
root.send(mthd) {|node| print "#{node.value} "}
puts
end
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 levelorder: 1 2 3 4 5 6 7 8 9
Rust
This solution uses iteration (rather than recursion) for all traversal types.
#![feature(box_syntax, box_patterns)]
use std::collections::VecDeque;
#[derive(Debug)]
struct TreeNode<T> {
value: T,
left: Option<Box<TreeNode<T>>>,
right: Option<Box<TreeNode<T>>>,
}
enum TraversalMethod {
PreOrder,
InOrder,
PostOrder,
LevelOrder,
}
impl<T> TreeNode<T> {
pub fn new(arr: &[[i8; 3]]) -> TreeNode<i8> {
let l = match arr[0][1] {
-1 => None,
i @ _ => Some(Box::new(TreeNode::<i8>::new(&arr[(i - arr[0][0]) as usize..]))),
};
let r = match arr[0][2] {
-1 => None,
i @ _ => Some(Box::new(TreeNode::<i8>::new(&arr[(i - arr[0][0]) as usize..]))),
};
TreeNode {
value: arr[0][0],
left: l,
right: r,
}
}
pub fn traverse(&self, tr: &TraversalMethod) -> Vec<&TreeNode<T>> {
match tr {
&TraversalMethod::PreOrder => self.iterative_preorder(),
&TraversalMethod::InOrder => self.iterative_inorder(),
&TraversalMethod::PostOrder => self.iterative_postorder(),
&TraversalMethod::LevelOrder => self.iterative_levelorder(),
}
}
fn iterative_preorder(&self) -> Vec<&TreeNode<T>> {
let mut stack: Vec<&TreeNode<T>> = Vec::new();
let mut res: Vec<&TreeNode<T>> = Vec::new();
stack.push(self);
while !stack.is_empty() {
let node = stack.pop().unwrap();
res.push(node);
match node.right {
None => {}
Some(box ref n) => stack.push(n),
}
match node.left {
None => {}
Some(box ref n) => stack.push(n),
}
}
res
}
// From left to right
fn iterative_inorder(&self) -> Vec<&TreeNode<T>> {
let mut stack: Vec<&TreeNode<T>> = Vec::new();
let mut res: Vec<&TreeNode<T>> = Vec::new();
let mut opt = Some(self);
while {
// Descend leftwards
while let Some(tree) = opt {
stack.push(tree);
opt = tree.left.as_deref();
}
!stack.is_empty()
} {
let tree = stack.pop().unwrap();
res.push(tree);
opt = tree.right.as_deref();
}
res
}
// Left-to-right postorder is same sequence as right-to-left preorder, reversed
fn iterative_postorder(&self) -> Vec<&TreeNode<T>> {
let mut stack: Vec<&TreeNode<T>> = Vec::new();
let mut res: Vec<&TreeNode<T>> = Vec::new();
stack.push(self);
while !stack.is_empty() {
let node = stack.pop().unwrap();
res.push(node);
match node.left {
None => {}
Some(box ref n) => stack.push(n),
}
match node.right {
None => {}
Some(box ref n) => stack.push(n),
}
}
let rev_iter = res.iter().rev();
let mut rev: Vec<&TreeNode<T>> = Vec::new();
for elem in rev_iter {
rev.push(elem);
}
rev
}
fn iterative_levelorder(&self) -> Vec<&TreeNode<T>> {
let mut queue: VecDeque<&TreeNode<T>> = VecDeque::new();
let mut res: Vec<&TreeNode<T>> = Vec::new();
queue.push_back(self);
while !queue.is_empty() {
let node = queue.pop_front().unwrap();
res.push(node);
match node.left {
None => {}
Some(box ref n) => queue.push_back(n),
}
match node.right {
None => {}
Some(box ref n) => queue.push_back(n),
}
}
res
}
}
fn main() {
// Array representation of task tree
let arr_tree = [[1, 2, 3],
[2, 4, 5],
[3, 6, -1],
[4, 7, -1],
[5, -1, -1],
[6, 8, 9],
[7, -1, -1],
[8, -1, -1],
[9, -1, -1]];
let root = TreeNode::<i8>::new(&arr_tree);
for method_label in [(TraversalMethod::PreOrder, "pre-order:"),
(TraversalMethod::InOrder, "in-order:"),
(TraversalMethod::PostOrder, "post-order:"),
(TraversalMethod::LevelOrder, "level-order:")]
.iter() {
print!("{}\t", method_label.1);
for n in root.traverse(&method_label.0) {
print!(" {}", n.value);
}
print!("\n");
}
}
Output is same as Ruby et al.
Scala
case class IntNode(value: Int, left: Option[IntNode] = None, right: Option[IntNode] = None) {
def preorder(f: IntNode => Unit) {
f(this)
left.map(_.preorder(f)) // Same as: if(left.isDefined) left.get.preorder(f)
right.map(_.preorder(f))
}
def postorder(f: IntNode => Unit) {
left.map(_.postorder(f))
right.map(_.postorder(f))
f(this)
}
def inorder(f: IntNode => Unit) {
left.map(_.inorder(f))
f(this)
right.map(_.inorder(f))
}
def levelorder(f: IntNode => Unit) {
def loVisit(ls: List[IntNode]): Unit = ls match {
case Nil => None
case node :: rest => f(node); loVisit(rest ++ node.left ++ node.right)
}
loVisit(List(this))
}
}
object TreeTraversal extends App {
implicit def intNode2SomeIntNode(n: IntNode) = Some[IntNode](n)
val tree = IntNode(1,
IntNode(2,
IntNode(4,
IntNode(7)),
IntNode(5)),
IntNode(3,
IntNode(6,
IntNode(8),
IntNode(9))))
List(
" preorder: " -> tree.preorder _, // `_` denotes the function value of type `IntNode => Unit` (returning nothing)
" inorder: " -> tree.inorder _,
" postorder: " -> tree.postorder _,
"levelorder: " -> tree.levelorder _) foreach {
case (name, func) =>
val s = new StringBuilder(name)
func(n => s ++= n.value.toString + " ")
println(s)
}
}
Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 levelorder: 1 2 3 4 5 6 7 8 9
Scheme
(define (preorder tree)
(if (null? tree)
'()
(append (list (car tree))
(preorder (cadr tree))
(preorder (caddr tree)))))
(define (inorder tree)
(if (null? tree)
'()
(append (inorder (cadr tree))
(list (car tree))
(inorder (caddr tree)))))
(define (postorder tree)
(if (null? tree)
'()
(append (postorder (cadr tree))
(postorder (caddr tree))
(list (car tree)))))
(define (level-order tree)
(define lst '())
(define (traverse nodes)
(if (pair? nodes)
(let ((next-nodes '()))
(do ((p nodes (cdr p)))
((null? p))
(set! lst (cons (caar p) lst))
(let* ((n '())
(n (if (null? (cadar p))
n
(cons (cadar p) n)))
(n (if (null? (caddar p))
n
(cons (caddar p) n))))
(set! next-nodes (append n next-nodes))))
(traverse (reverse next-nodes)))))
(if (null? tree)
'()
(begin
(traverse (list tree))
(reverse lst))))
(define (demonstration tree)
(define (display-values lst)
(do ((p lst (cdr p)))
((null? p))
(display (car p))
(if (pair? (cdr p))
(display " ")))
(newline))
(display "preorder: ") (display-values (preorder tree))
(display "inorder: ") (display-values (inorder tree))
(display "postorder: ") (display-values (postorder tree))
(display "level-order: ") (display-values (level-order tree)))
(define the-task-tree
'(1 (2 (4 (7 () ())
())
(5 () ()))
(3 (6 (8 () ())
(9 () ()))
())))
(demonstration the-task-tree)
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
SequenceL
main(args(2)) :=
"preorder: " ++ toString(preOrder(testTree)) ++
"\ninoder: " ++ toString(inOrder(testTree)) ++
"\npostorder: " ++ toString(postOrder(testTree)) ++
"\nlevel-order: " ++ toString(levelOrder(testTree));
Node ::= (value : int, left : Node, right : Node);
preOrder(n) := [n.value] ++
(preOrder(n.left) when isDefined(n, left) else []) ++
(preOrder(n.right) when isDefined(n, right) else []);
inOrder(n) := (inOrder(n.left) when isDefined(n, left) else []) ++
[n.value] ++
(inOrder(n.right) when isDefined(n, right) else []);
postOrder(n) := (postOrder(n.left) when isDefined(n, left) else []) ++
(postOrder(n.right) when isDefined(n, right) else []) ++
[n.value];
levelOrder(n) := levelOrderHelper([n]);
levelOrderHelper(ns(1)) :=
let
n := head(ns);
in
[] when size(ns) = 0 else
[n.value] ++ levelOrderHelper(tail(ns) ++
([n.left] when isDefined(n, left) else []) ++
([n.right] when isDefined(n, right) else []));
testTree :=
(value : 1,
left : (value : 2,
left : (value : 4,
left : (value : 7)),
right : (value : 5)),
right : (value : 3,
left : (value : 6,
left : (value : 8),
right : (value : 9))
)
);
- Output:
Output:
preorder: [1,2,4,7,5,3,6,8,9] inoder: [7,4,2,5,1,8,6,9,3] postorder: [7,4,5,2,8,9,6,3,1] level-order: [1,2,3,4,5,6,7,8,9]
SETL
program tree_traversal;
tree := [1, [2, [4, [7]], [5]], [3, [6, [8], [9]]]];
print("preorder ", preorder(tree));
print("inorder ", inorder(tree));
print("postorder ", postorder(tree));
print("level-order ", levelorder(tree));
proc preorder(tree);
if tree = om then return []; end if;
[item, left, right] := tree;
return [item] + preorder(left) + preorder(right);
end proc;
proc inorder(tree);
if tree = om then return []; end if;
[item, left, right] := tree;
return inorder(left) + [item] + inorder(right);
end proc;
proc postorder(tree);
if tree = om then return []; end if;
[item, left, right] := tree;
return postorder(left) + postorder(right) + [item];
end proc;
proc levelorder(tree);
items := [];
loop init queue := [tree]; while queue /= [] do
[item, left, right] fromb queue;
items with:= item;
if left /= om then queue with:= left; end if;
if right /= om then queue with:= right; end if;
end loop;
return items;
end proc;
end program;
- Output:
preorder [1 2 4 7 5 3 6 8 9] inorder [7 4 2 5 1 8 6 9 3] postorder [7 4 5 2 8 9 6 3 1] level-order [1 2 3 4 5 6 7 8 9]
Sidef
func preorder(t) {
t ? [t[0], __FUNC__(t[1])..., __FUNC__(t[2])...] : [];
}
func inorder(t) {
t ? [__FUNC__(t[1])..., t[0], __FUNC__(t[2])...] : [];
}
func postorder(t) {
t ? [__FUNC__(t[1])..., __FUNC__(t[2])..., t[0]] : [];
}
func depth(t) {
var a = [t];
var ret = [];
while (a.len > 0) {
var v = (a.shift \\ next);
ret « v[0];
a += [v[1,2]];
};
return ret;
}
var x = [1,[2,[4,[7]],[5]],[3,[6,[8],[9]]]];
say "pre: #{preorder(x)}";
say "in: #{inorder(x)}";
say "post: #{postorder(x)}";
say "depth: #{depth(x)}";
- Output:
pre: 1 2 4 7 5 3 6 8 9 in: 7 4 2 5 1 8 6 9 3 post: 7 4 5 2 8 9 6 3 1 depth: 1 2 3 4 5 6 7 8 9
Smalltalk
This solution relies on a binary tree that distinguishes between ordinary and empty nodes. Therefore, the tree can be traversed using a visitor pattern that uses a polymorphic access message. The traversal variants are implemented as subclasses of a generic visitor. The action to be performed with each (non-empty) node is provided as block to the traversal algorithm.
The code below is plain, human-readable code instead of a file-out of some specific Smalltalk dialect. It shows only the messages of each class but not its definition as they differ between dialects.
Object subclass: EmptyNode
"Protocol: visiting"
EmptyNode>>accept: aVisitor
EmptyNode>>accept: aVisitor with: anObject
^anObject
"Protocol: enumerating"
EmptyNode>>traverse: aVisitorClass do: aBlock
^self accept: (aVisitorClass block: aBlock)
EmptyNode subclass: Node
"Protocol: visiting"
Node>>accept: aVisitor
^aVisitor visit: self
Node>>accept: aVisitor with: anObject
^aVisitor visit: self with: anObject
"Protocol: accessing"
Node>>data
^data
Node>>data: anObject
data := anObject
Node>>left
^left
Node>>left: aNode
left := aNode
Node>>right
^right
Node>>right: aNode
right := aNode
"Protocol: initialize-release"
Node>>initialize
super initialize.
left := right := EmptyNode new
"Class side"
"Protocol: instance creation"
Node class>>data: anObject
^self new data: anObject
Object subclass: Visitor
"Protocol: visiting"
visit: aNode
self subclassResponsibility
"Protocol: accessing"
Visitor>>block: anObject
block := anObject
"Protocol: initialize-release"
Visitor>>initialize
super initialize.
block := [:node | ]
"Class side"
"Protocol: instance creation"
Visitor class>>block: aBlock
^self new block: aBlock
Visitor subclass: InOrder
"Protocol: visiting"
InOrder>>visit: aNode
aNode left accept: self.
block value: aNode.
aNode right accept: self
Visitor subclass: LevelOrder
"Protocol: visiting"
LevelOrder>>visit: aNode
| queue |
queue := OrderedCollection with: aNode.
[(queue removeFirst accept: self with: queue) isEmpty] whileFalse
LevelOrder>>visit: aNode with: aQueue
block value: aNode.
^aQueue
add: aNode left;
add: aNode right;
yourself
Visitor subclass: PostOrder
"Protocol: visiting"
PostOrder>>visit: aNode
aNode left accept: self.
aNode right accept: self.
block value: aNode
"Visitor subclass: PreOrder"
"Protocol: visiting"
PreOrder>>visit: aNode
block value: aNode.
aNode left accept: self.
aNode right accept: self
Execute code in a Workspace:
| tree |
tree := (Node data: 1)
left: ((Node data: 2)
left: ((Node data: 4)
left: (Node data: 7));
right: (Node data: 5));
right: ((Node data: 3)
left: ((Node data: 6)
left: (Node data: 8);
right: (Node data: 9))).
tree traverse: PreOrder do: [:node | Transcript print: node data; space].
Transcript cr.
tree traverse: InOrder do: [:node | Transcript print: node data; space].
Transcript cr.
tree traverse: PostOrder do: [:node | Transcript print: node data; space].
Transcript cr.
tree traverse: LevelOrder do: [:node | Transcript print: node data; space].
Transcript cr.
Output in Transcript:
1 2 4 7 5 3 6 8 9 7 4 2 5 1 8 6 9 3 7 4 5 2 8 9 6 3 1 1 2 3 4 5 6 7 8 9
Swift
class TreeNode<T> {
let value: T
let left: TreeNode?
let right: TreeNode?
init(value: T, left: TreeNode? = nil, right: TreeNode? = nil) {
self.value = value
self.left = left
self.right = right
}
func preOrder(function: (T) -> Void) {
function(value)
if left != nil {
left!.preOrder(function: function)
}
if right != nil {
right!.preOrder(function: function)
}
}
func inOrder(function: (T) -> Void) {
if left != nil {
left!.inOrder(function: function)
}
function(value)
if right != nil {
right!.inOrder(function: function)
}
}
func postOrder(function: (T) -> Void) {
if left != nil {
left!.postOrder(function: function)
}
if right != nil {
right!.postOrder(function: function)
}
function(value)
}
func levelOrder(function: (T) -> Void) {
var queue: [TreeNode] = []
queue.append(self)
while queue.count > 0 {
let node = queue.removeFirst()
function(node.value)
if node.left != nil {
queue.append(node.left!)
}
if node.right != nil {
queue.append(node.right!)
}
}
}
}
typealias Node = TreeNode<Int>
let n = Node(value: 1,
left: Node(value: 2,
left: Node(value: 4,
left: Node(value: 7)),
right: Node(value: 5)),
right: Node(value: 3,
left: Node(value: 6,
left: Node(value: 8),
right: Node(value: 9))))
let fn = { print($0, terminator: " ") }
print("pre-order: ", terminator: "")
n.preOrder(function: fn)
print()
print("in-order: ", terminator: "")
n.inOrder(function: fn)
print()
print("post-order: ", terminator: "")
n.postOrder(function: fn)
print()
print("level-order: ", terminator: "")
n.levelOrder(function: fn)
print()
- Output:
pre-order: 1 2 4 7 5 3 6 8 9 in-order: 7 4 2 5 1 8 6 9 3 post-order: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
Tcl
or
oo::class create tree {
# Basic tree data structure stuff...
variable val l r
constructor {value {left {}} {right {}}} {
set val $value
set l $left
set r $right
}
method value {} {return $val}
method left {} {return $l}
method right {} {return $r}
destructor {
if {$l ne ""} {$l destroy}
if {$r ne ""} {$r destroy}
}
# Traversal methods
method preorder {varName script {level 0}} {
upvar [incr level] $varName var
set var $val
uplevel $level $script
if {$l ne ""} {$l preorder $varName $script $level}
if {$r ne ""} {$r preorder $varName $script $level}
}
method inorder {varName script {level 0}} {
upvar [incr level] $varName var
if {$l ne ""} {$l inorder $varName $script $level}
set var $val
uplevel $level $script
if {$r ne ""} {$r inorder $varName $script $level}
}
method postorder {varName script {level 0}} {
upvar [incr level] $varName var
if {$l ne ""} {$l postorder $varName $script $level}
if {$r ne ""} {$r postorder $varName $script $level}
set var $val
uplevel $level $script
}
method levelorder {varName script} {
upvar 1 $varName var
set nodes [list [self]]; # A queue of nodes to process
while {[llength $nodes] > 0} {
set nodes [lassign $nodes n]
set var [$n value]
uplevel 1 $script
if {[$n left] ne ""} {lappend nodes [$n left]}
if {[$n right] ne ""} {lappend nodes [$n right]}
}
}
}
Note that in Tcl it is conventional to handle performing something “for each element” by evaluating a script in the caller's scope for each node after setting a caller-nominated variable to the value for that iteration. Doing this transparently while recursing requires the use of a varying ‘level’ parameter to upvar
and uplevel
, but makes for compact and clear code.
Demo code to satisfy the official challenge instance:
# Helpers to make construction and listing of a whole tree simpler
proc Tree nested {
lassign $nested v l r
if {$l ne ""} {set l [Tree $l]}
if {$r ne ""} {set r [Tree $r]}
tree new $v $l $r
}
proc Listify {tree order} {
set list {}
$tree $order v {
lappend list $v
}
return $list
}
# Make a tree, print it a few ways, and destroy the tree
set t [Tree {1 {2 {4 7} 5} {3 {6 8 9}}}]
puts "preorder: [Listify $t preorder]"
puts "inorder: [Listify $t inorder]"
puts "postorder: [Listify $t postorder]"
puts "level-order: [Listify $t levelorder]"
$t destroy
Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
UNIX Shell
Bash (also "sh" on most Unix systems) has arrays. We implement a node as an association between three arrays: left, right, and value.
left=()
right=()
value=()
# node node#, left#, right#, value
#
# if value is empty, use node#
node() {
nx=${1:-'Missing node index'}
leftx=${2}
rightx=${3}
val=${4:-$1}
value[$nx]="$val"
left[$nx]="$leftx"
right[$nx]="$rightx"
}
# define the tree
node 1 2 3
node 2 4 5
node 3 6
node 4 7
node 5
node 6 8 9
node 7
node 8
node 9
# walk NODE# ORDER
walk() {
local nx=${1-"Missing index"}
shift
for branch in "$@" ; do
case "$branch" in
left) if [[ "${left[$nx]}" ]]; then walk ${left[$nx]} $@ ; fi ;;
right) if [[ "${right[$nx]}" ]]; then walk ${right[$nx]} $@ ; fi ;;
self) printf "%d " "${value[$nx]}" ;;
esac
done
}
apush() {
local var="$1"
eval "$var=( \"\${$var[@]}\" \"$2\" )"
}
showname() {
printf "%-12s " "$1:"
}
showdata() {
showname "$1"
shift
walk "$@"
echo ''
}
preorder() { showdata $FUNCNAME $1 self left right ; }
inorder() { showdata $FUNCNAME $1 left self right ; }
postorder() { showdata $FUNCNAME $1 left right self ; }
levelorder() {
showname 'level-order'
queue=( $1 )
x=0
while [[ $x < ${#queue[*]} ]]; do
value="${queue[$x]}"
printf "%d " "$value"
for more in "${left[$value]}" "${right[$value]}" ; do
if [[ -n "$more" ]]; then
apush queue "$more"
fi
done
: $((x++))
done
echo ''
}
preorder 1
inorder 1
postorder 1
levelorder 1
The output:
preorder: 1 2 4 7 5 3 6 8 9
inorder: 7 4 2 5 1 8 6 9 3
postorder: 7 4 5 2 8 9 6 3 1
level-order: 1 2 3 4 5 6 7 8 9
Ursala
Ursala has built-in notation for trees and is perfect for whipping up little tree walking functions. This source listing shows the tree depicted above declared as a constant, followed by declarations of four functions applicable to trees of any type. The main program applies all four of them to the tree and makes a list of their results, each of which is a list of natural numbers. The compiler directive #cast %nLL induces the compile-time side effect of displaying the result on standard output as a list of lists of naturals.
tree =
1^:<
2^: <4^: <7^: <>, 0>, 5^: <>>,
3^: <6^: <8^: <>, 9^: <>>, 0>>
pre = ~&dvLPCo
post = ~&vLPdNCTo
in = ~&vvhPdvtL2CTiQo
lev = ~&iNCaadSPfavSLiF3RTaq
#cast %nLL
main = <.pre,in,post,lev> tree
output:
< <1,2,4,7,5,3,6,8,9>, <7,4,2,5,1,8,6,9,3>, <7,4,5,2,8,9,6,3,1>, <1,2,3,4,5,6,7,8,9>>
VBA
TreeItem Class Module
Public Value As Integer
Public LeftChild As TreeItem
Public RightChild As TreeItem
Module
Dim tihead As TreeItem
Private Function Add(v As Integer, left As TreeItem, right As TreeItem) As TreeItem
Dim x As New TreeItem
x.Value = v
Set x.LeftChild = left
Set x.RightChild = right
Set Add = x
End Function
Private Sub Init()
Set tihead = Add(1, _
Add(2, _
Add(4, _
Add(7, Nothing, Nothing), _
Nothing), _
Add(5, Nothing, Nothing)), _
Add(3, _
Add(6, _
Add(8, Nothing, Nothing), _
Add(9, Nothing, Nothing)), _
Nothing))
End Sub
Private Sub InOrder(ti As TreeItem)
If Not ti Is Nothing Then
Call InOrder(ti.LeftChild)
Debug.Print ti.Value;
Call InOrder(ti.RightChild)
End If
End Sub
Private Sub PreOrder(ti As TreeItem)
If Not ti Is Nothing Then
Debug.Print ti.Value;
Call PreOrder(ti.LeftChild)
Call PreOrder(ti.RightChild)
End If
End Sub
Private Sub PostOrder(ti As TreeItem)
If Not ti Is Nothing Then
Call PostOrder(ti.LeftChild)
Call PostOrder(ti.RightChild)
Debug.Print ti.Value;
End If
End Sub
Private Sub LevelOrder(ti As TreeItem)
Dim queue As Object
Set queue = CreateObject("System.Collections.Queue")
queue.Enqueue ti
Do While (queue.Count > 0)
Set next_ = queue.Dequeue
Debug.Print next_.Value;
If Not next_.LeftChild Is Nothing Then queue.Enqueue next_.LeftChild
If Not next_.RightChild Is Nothing Then queue.Enqueue next_.RightChild
Loop
End Sub
Public Sub Main()
Init
Debug.Print "preorder: ";
Call PreOrder(tihead)
Debug.Print vbCrLf; "inorder: ";
Call InOrder(tihead)
Debug.Print vbCrLf; "postorder: ";
Call PostOrder(tihead)
Debug.Print vbCrLf; "level-order: ";
Call LevelOrder(tihead)
End Sub
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
VBScript
' 1
' / \
' / \
' / \
' 2 3
' / \ /
' 4 5 6
' / / \
' 7 8 9
'with no pointers available, the binary tree has to be saved in an array
' root at index 1
' parent index is i\2
' children indexes are i*2 and i*2+1
' a value of 0 denotes an empty branch
Sub print(s):
On Error Resume Next
WScript.stdout.Write(s)
If err= &h80070006& Then WScript.Echo " Please run this script with CScript": WScript.quit
End Sub
Sub inorder(i)
If tree(i*2)<>0 Then inorder(i*2)
print tree(i)& vbtab
If tree(i*2+1)<>0 Then inorder(i*2+1)
End Sub
Sub preorder(i)
print tree(i)& vbtab
If tree(i*2)<>0 Then preorder(i*2)
If tree(i*2+1)<>0 Then preorder(i*2+1)
End Sub
Sub postorder(i)
If tree(i*2)<>0 Then postorder(i*2)
If tree(i*2+1)<>0 Then postorder(i*2+1)
print tree(i)& vbTab
End Sub
Sub levelorder(x)
Dim i
For i= 1 To UBound(tree)
If tree(i)<>0 Then print tree(i)& vbTab
Next
End sub
Dim tree
' 1 2 3 4 5 6 7 8 9 1011121314151617181920212223242526
' 1 2 2 3 3 3 3 4 4 4 4 4 4 4 4
tree=Array(0,1,2,3,4,5,6,0,7,0,0,0,8,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0)
print vbCrLf & "Preorder" & vbcrlf
preorder(1)
print vbCrLf & "Inorder" & vbcrlf
inorder(1)
print vbCrLf & "Postorder" & vbcrlf
postorder(1)
print vbCrLf & "Levelorder" & vbcrlf
levelorder(1)
- Output:
Preorder 1 2 4 7 5 3 6 8 9 Inorder 7 4 2 5 1 8 6 9 3 Postorder 7 4 5 2 8 9 6 3 1 Levelorder 1 2 3 4 5 6 7 8 9
Wren
The object-oriented version.
class Node {
construct new(v) {
_v = v
_left = null
_right = null
}
value { _v }
left { _left }
right { _right}
left =(n) { _left = n }
right= (n) { _right = n }
preOrder() {
System.write(this)
if (_left) _left.preOrder()
if (_right) _right.preOrder()
}
inOrder() {
if ( _left) _left.inOrder()
System.write(this)
if (_right) _right.inOrder()
}
postOrder() {
if (_left) _left.postOrder()
if (_right) _right.postOrder()
System.write(this)
}
levelOrder() {
var queue = [this]
while (true) {
var node = queue.removeAt(0)
System.write(node)
if (node.left) queue.add(node.left)
if (node.right) queue.add(node.right)
if (queue.isEmpty) break
}
}
exec(name, f) {
System.write(name)
f.call(this)
System.print()
}
toString { " %(_v)" }
}
var nodes = List.filled(10, null)
for (i in 0..9) nodes[i] = Node.new(i)
nodes[1].left = nodes[2]
nodes[1].right = nodes[3]
nodes[2].left = nodes[4]
nodes[2].right = nodes[5]
nodes[4].left = nodes[7]
nodes[3].left = nodes[6]
nodes[6].left = nodes[8]
nodes[6].right = nodes[9]
nodes[1].exec(" preOrder:", Fn.new { |n| n.preOrder() })
nodes[1].exec(" inOrder:", Fn.new { |n| n.inOrder() })
nodes[1].exec(" postOrder:", Fn.new { |n| n.postOrder() })
nodes[1].exec("level-order:", Fn.new { |n| n.levelOrder() })
- Output:
preOrder: 1 2 4 7 5 3 6 8 9 inOrder: 7 4 2 5 1 8 6 9 3 postOrder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
XPL0
def \Node\ Left, Data, Right;
proc PreOrder(Node); \Traverse tree at Node in preorder
int Node;
[if Node # 0 then
[IntOut(0, Node(Data)); ChOut(0, ^ );
PreOrder(Node(Left));
PreOrder(Node(Right));
];
];
proc InOrder(Node); \Traverse tree at Node in inorder
int Node;
[if Node # 0 then
[InOrder(Node(Left));
IntOut(0, Node(Data)); ChOut(0, ^ );
InOrder(Node(Right));
];
];
proc PostOrder(Node); \Traverse tree at Node in postorder
int Node;
[if Node # 0 then
[PostOrder(Node(Left));
PostOrder(Node(Right));
IntOut(0, Node(Data)); ChOut(0, ^ );
];
];
proc LevelOrder(Node); \Traverse tree at Node in level-order
int Node;
def S=100*3; \size of queue (must be a multiple of 3 for wrap-around)
int Q(S), \queue (FIFO)
F, E; \fill and empty indexes
proc EnQ(Node); \Enqueue Node
int Node;
[Q(F):= Node(Left); F:= F+1;
Q(F):= Node(Data); F:= F+1;
Q(F):= Node(Right); F:= F+1;
if F >= S then F:= 0;
];
proc DeQ; \Dequeue Node
[Node(Left):= Q(E); E:= E+1;
Node(Data):= Q(E); E:= E+1;
Node(Right):= Q(E); E:= E+1;
if E >= S then E:= 0;
];
[F:= 0; E:= 0; \empty queue
EnQ(Node);
while E # F do
[DeQ;
IntOut(0, Node(Data)); ChOut(0, ^ );
if Node(Left) # 0 then
EnQ(Node(Left));
if Node(Right) # 0 then
EnQ(Node(Right));
];
];
int Tree;
[Tree:= [[ [[0,7,0],4,0], 2, [0,5,0]], 1, [ [[0,8,0], 6, [0,9,0]], 3, 0 ]];
Text(0, "preorder: "); PreOrder(Tree); CrLf(0);
Text(0, "inorder: "); InOrder(Tree); CrLf(0);
Text(0, "postorder: "); PostOrder(Tree); CrLf(0);
Text(0, "level-order: "); LevelOrder(Tree); CrLf(0);
]
- Output:
preorder: 1 2 4 7 5 3 6 8 9 inorder: 7 4 2 5 1 8 6 9 3 postorder: 7 4 5 2 8 9 6 3 1 level-order: 1 2 3 4 5 6 7 8 9
zkl
class Node{ var [mixin=Node]left,right; var v;
fcn init(val,[Node]l=Void,[Node]r=Void) { v,left,right=vm.arglist }
}
class BTree{ var [mixin=Node] root;
fcn init(r){ root=r }
const VISIT=Void, LEFT="left", RIGHT="right";
fcn preOrder { traverse(VISIT,LEFT, RIGHT) }
fcn inOrder { traverse(LEFT, VISIT,RIGHT) }
fcn postOrder { traverse(LEFT, RIGHT,VISIT) }
fcn [private] traverse(order){ //--> list of Nodes
sink:=List();
fcn(sink,[Node]n,order){
if(n){ foreach o in (order){
if(VISIT==o) sink.write(n);
else self.fcn(sink,n.setVar(o),order); // actually get var, eg n.left
}}
}(sink,root,vm.arglist);
sink
}
fcn levelOrder{ // breadth first
sink:=List(); q:=List(root);
while(q){
n:=q.pop(0); l:=n.left; r:=n.right;
sink.write(n);
if(l) q.append(l);
if(r) q.append(r);
}
sink
}
}
It is easy to convert to lazy by replacing "sink.write" with "vm.yield" and wrapping the traversal with a Utils.Generator.
t:=BTree(Node(1,
Node(2,
Node(4,Node(7)),
Node(5)),
Node(3,
Node(6, Node(8),Node(9)))));
t.preOrder() .apply("v").println(" preorder");
t.inOrder() .apply("v").println(" inorder");
t.postOrder() .apply("v").println(" postorder");
t.levelOrder().apply("v").println(" level-order");
The "apply("v")" extracts the contents of var v from each node.
- Output:
L(1,2,4,7,5,3,6,8,9) preorder L(7,4,2,5,1,8,6,9,3) inorder L(7,4,5,2,8,9,6,3,1) postorder L(1,2,3,4,5,6,7,8,9) level-order
- Programming Tasks
- Data Structures
- Recursion
- 11l
- 8080 Assembly
- 8086 Assembly
- AArch64 Assembly
- ACL2
- Action!
- Action! Tool Kit
- Ada
- Agda
- ALGOL 68
- APL
- AppleScript
- ARM Assembly
- ATS
- AutoHotkey
- AWK
- Bracmat
- BCPL
- C
- C sharp
- C++
- Boost
- Ceylon
- Clojure
- CLU
- CoffeeScript
- Common Lisp
- Coq
- Crystal
- D
- Delphi
- SysUtils,StdCtrls
- Draco
- E
- EasyLang
- Eiffel
- Elena
- Elisa
- Elixir
- EMal
- Erlang
- Euphoria
- F Sharp
- Factor
- Fantom
- Forth
- Fortran
- FreeBASIC
- FunL
- Fōrmulæ
- GFA Basic
- Go
- Groovy
- Haskell
- Icon
- Unicon
- Isabelle
- J
- Java
- JavaScript
- Jq
- Julia
- Kotlin
- Lambdatalk
- Lingo
- Logo
- Logtalk
- Lua
- M2000 Interpreter
- Mathematica
- Wolfram Language
- Mercury
- Miranda
- Nim
- Objeck
- OCaml
- Oforth
- OoRexx
- Oz
- PascalABC.NET
- Perl
- Phix
- Phix/basics
- PHP
- PicoLisp
- Prolog
- PureBasic
- Python
- Qi
- Quackery
- Racket
- Raku
- REBOL
- Refal
- REXX
- Ruby
- Rust
- Scala
- Scheme
- SequenceL
- SETL
- Sidef
- Smalltalk
- Swift
- Tcl
- TclOO
- UNIX Shell
- Ursala
- VBA
- VBScript
- Wren
- XPL0
- Zkl
- Pages with too many expensive parser function calls