-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinaryTree.swift
75 lines (64 loc) · 1.77 KB
/
BinaryTree.swift
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
//
// BinaryTree.swift
// DataStructures
//
// Created by Sicc on 21/10/2019.
// Copyright © 2019 chang sic jung. All rights reserved.
//
import Foundation
public class BinaryNode<T> {
public var value: T
public var leftChild: BinaryNode?
public var rightChild: BinaryNode?
public init(_ value: T) {
self.value = value
}
public func traverseInOrder(visit: ((T) -> Void)? = nil) {
leftChild?.traverseInOrder(visit: visit)
if let visit = visit {
visit(value)
}else{
print(value)
}
rightChild?.traverseInOrder(visit: visit)
}
public func traversePreOrder(visit: ((T) -> Void)? = nil) {
if let visit = visit {
visit(value)
}else{
print(value)
}
leftChild?.traversePreOrder(visit: visit)
rightChild?.traversePreOrder(visit: visit)
}
public func traversePostOrder(visit: ((T) -> Void)? = nil) {
leftChild?.traversePreOrder(visit: visit)
rightChild?.traversePreOrder(visit: visit)
if let visit = visit {
visit(value)
}else{
print(value)
}
}
}
extension BinaryNode: CustomStringConvertible {
public var description: String {
return diagram(for: self)
}
private func diagram(for node: BinaryNode?,
_ top: String = "",
_ root: String = "",
_ bottom: String = "") -> String {
guard let node = node else {
return root + "nil\n"
}
if node.leftChild == nil && node.rightChild == nil {
return root + "\(node.value)\n"
}
return diagram(for: node.rightChild,
top + " ", top + "┌──", top + "│ ")
+ root + "\(node.value)\n"
+ diagram(for: node.leftChild,
bottom + "│ ", bottom + "└──", bottom + " ")
}
}