Binary Tree : Swift 5.0 | Part-7

Part of Quick ramp up Data Structure series to understand standard operations implemented using Swift.

Do check out Part-1 , Part-2, Part-3, Part-4, Part-5, Part-6 before proceeding further.

41. Construct Binary Search Tree from Preorder Traversal : https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/

“Solution 1 ”

“Solution 2”

42. Serialization and Deserialization BST : https://leetcode.com/problems/serialize-and-deserialize-bst/

“ Serialize and De-serialization BST”

43. N-ary Tree Preorder Traversal : https://leetcode.com/problems/n-ary-tree-preorder-traversal/

“N-ary Tree Preorder Traversal”

44. N-ary Tree Postorder Traversal : https://leetcode.com/problems/n-ary-tree-postorder-traversal/

“N-ary Tree Postorder Traversal”

45. N-ary Tree Level Order Traversal : https://leetcode.com/problems/n-ary-tree-level-order-traversal/

“ N-ary Tree Level Order Traversal”

46. Convert Sorted Array to Binary Search Tree : https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/

“Convert Sorted Array to Binary Search Tree”

Follow Rahul Goel on Medium for updates — @therahulgoel