xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-15 00:26:05 +00:00
Code Issues Packages Projects Releases Wiki Activity

Feature/array representation of tree swift (#649)

Browse Source 
* refactor: encode & decode Tree

* style: build warning

* feat: add Swift codes for array_representation_of_tree article
This commit is contained in:
nuomi1
2023-07-24 12:46:48 +08:00
committed by GitHub
parent c1adeb2399
commit 9ab4b0b15c
12 changed files with 200 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/swift/chapter_backtracking/preorder_traversal_i_compact.swift
+1 -1
View File
@@ -25,7 +25,7 @@ func preOrder(root: TreeNode?) {
enum PreorderTraversalICompact {
/* Driver Code */
static func main() {
let root = TreeNode.listToTree(list: [1, 7, 3, 4, 5, 6, 7])
let root = TreeNode.listToTree(arr: [1, 7, 3, 4, 5, 6, 7])
print("\n初始化二叉树")
PrintUtil.printTree(root: root)
codes/swift/chapter_backtracking/preorder_traversal_ii_compact.swift
+1 -1
View File
@@ -30,7 +30,7 @@ func preOrder(root: TreeNode?) {
enum PreorderTraversalIICompact {
/* Driver Code */
static func main() {
let root = TreeNode.listToTree(list: [1, 7, 3, 4, 5, 6, 7])
let root = TreeNode.listToTree(arr: [1, 7, 3, 4, 5, 6, 7])
print("\n初始化二叉树")
PrintUtil.printTree(root: root)
codes/swift/chapter_backtracking/preorder_traversal_iii_compact.swift
+1 -1
View File
@@ -33,7 +33,7 @@ func preOrder(root: TreeNode?) {
enum PreorderTraversalIIICompact {
/* Driver Code */
static func main() {
let root = TreeNode.listToTree(list: [1, 7, 3, 4, 5, 6, 7])
let root = TreeNode.listToTree(arr: [1, 7, 3, 4, 5, 6, 7])
print("\n初始化二叉树")
PrintUtil.printTree(root: root)
codes/swift/chapter_backtracking/preorder_traversal_iii_template.swift
+1 -1
View File
@@ -56,7 +56,7 @@ func backtrack(state: inout [TreeNode], choices: [TreeNode], res: inout [[TreeNo
enum PreorderTraversalIIITemplate {
/* Driver Code */
static func main() {
let root = TreeNode.listToTree(list: [1, 7, 3, 4, 5, 6, 7])
let root = TreeNode.listToTree(arr: [1, 7, 3, 4, 5, 6, 7])
print("\n初始化二叉树")
PrintUtil.printTree(root: root)