From 47417794a0a13f0f4dbecc093bae4818068cce49 Mon Sep 17 00:00:00 2001
From: Hezekiah Branch <hezekiah.branch@tufts.edu>
Date: Fri, 24 Jul 2020 02:08:37 -0400
Subject: [PATCH] Adding submission before deadline

---
 week-6/C++/main     | Bin 0 -> 8448 bytes
 week-6/C++/main.cpp | 105 ++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 105 insertions(+)
 create mode 100644 week-6/C++/main

diff --git a/week-6/C++/main b/week-6/C++/main
new file mode 100644
index 0000000000000000000000000000000000000000..a258d701313c7e7e846e8212c59a7cd455b0f79d
GIT binary patch
literal 8448
zcmeHMeQZ=&6~8kBZTXrG$kzf1lU+z)v5zUAgM{5TZKu4h!-r5-RxOX|%+O9UovAZ#
z*rEg>?5>%ttVE;nKQU@F1{3}==pPFNT{JO<)ok2EHfdH+P|zAyBxa%h&VA=h-@LZQ
zXyRYo=FPe1ch2wLb3fj@AN@iy)g253l%$|~PLVb|)6|gri|jJ3G8R{}l&Myz<*EtD
z3_PZ`kaTk*A9B$mTi7oINxXQ_1>!+dXGE@WVbtL!iIC(>##~{t=E{>?fk>sI+D<%*
z_2=`n3VB#(M2>JACs_)QRN{>?Z<Ki=BkV6y+DC1pr<d)$K@%G3CJByeLXt0~y|<h!
z<v*ZGwKN-KN^44q6y7JmV+woxdl6ytKCW-Newi2_mq7hUX?-Ezzh%?<Lbk1tFIGp|
zM&euAwrnygC1ZnbH<eGmJ9i%-cSYk}?^@2&ILf#v1qKuu+qKDeq>1pFoK68+Fd0@`
zr@`Nt2B$cqc>HN409`)62X#BzU2(FRb?d0DTa;}N43&y@#YvYP+gA3ccJFuM`BKI1
zPgioAdWw0ct37#iD!h|$ls4oRgxo+TV^>IPCw$l$Ea%c$(qp7&q{7Td+D<#Uk-UT2
z$-uP_rSnC#Gu6}4dGMgU(b(kX?G45TV>7}JVhm^mXe6ks=}-5%ZojkkE10?=b&iZk
zWPKS@=1Fx~eioH+UR#wKYdx%UH0RtBUBg2UE_0JCOCyK1Lo<G<UP)08?wucNJh;pW
z;#jBewpg#v+%YGrtXD5P!SU<X>7TY-mEzR+<_$27uik{;)|Do5qz{t)&geMO>Ssx(
z5bj*p`qQLS)pssKKVa2vp^k`kDZvrk{smy`lH!SAy(tFkCvkE4I$UbW4-rbF@9Ghw
zb>%BmAp%fT-tF(f+;_EgWtURz_j+n?AF^uiTc>Z1?d|Qkc6qePRMxdC!&+QB3^Bgw
z#o1Byf%d=OP@Jg_Tr^RswL|~bZaGUXQbp7i^ZG6kI6kU*2t&&^2|Hk&`U?}RE004~
zZOpoI`*|zymi6{yXHmU`ITIx);h)^`6k<`;CAuLe(2%!gHUkN8d+wuIrkZFnx%K_I
zhRR=|z;yfDFJDW3NJ`(;vx!e8UhJv;HgO=)n>w?)yEzJvGi|#e_a|zPdTI|+YpMTR
ztSgT~w_6{h=U=_&MB9HS<)v!>Ow}HA)&80oUwFeheKlZhd$0N@nggHiOME8LmpGKL
zub!QV=RT%}E{|tP0CPC7Jha_HIP|T)@o0SfJCG|-)h{6nkaICRjzealpNBk4I9h%e
z@;Ky2VZRIMKrRGEDe$>{DlifWET7xlayHN$q4$Q?t_b++$N_0;U-um&--Ym%cVHFt
z7(Iy3gjC^3cX;Uwt#e*(IjNpsw*A?StDYv9cn9%V@arTX5sthT?3~wh0)ap!`v^TK
zyA`r-e__J@4ZsJ%pX0T6yY?<%G(jxzb7b!bN4^~F2rqpjlnh7D%;*TO`O-`)9DA+F
z3dc`3?+Tmca6A!?CBkbu!cq9aza!k@en-$>!=5%$aZl2d9(d9NPkP`<5BzUEu(!$7
z1svvWN|beca&_{{JwE&;pFZHzX)j1=t}E1q8K%zhu}IzI`krFDoU4|zF8fG1M!w7E
zC|aK=(OO06?~lhzBu9cKiTZgU7IJmkZ&ErJH1Vs{Z2jx5QIyqd801pM7qJvk->dT0
zP1al54^Wadn)a!bmbgL<a(e}jvo3MdT1^R?WSyjbEO)v+4>^8p8?-L<j<J55?M(l_
z2|365EBphu?*Ypuo>zXqot>Q@i>^7)UoAS-=vHI15o_C6)mr<B_P7z-wAMvcrjRZU
zM33gmm3*lPEJmIuT-TVPU5)nW8YewaS-&rtN+$Lv?X9uc`Xl*by0F$?ZG#@di6R~}
z8!%Gnyd&pruQ3FR%&$g#Mtxp2;xm=Zzec=CO*L*I)vRQ^8~t09%$r7hR(*ao;<M}T
zStCA2UFUIW#OJEW6yp?9^Xl(sqkmY9@q62dx8nZ6^g=ox!Y<Bio(i8|zfbX!LO4Oo
zd)|nD1otV2y^zj_@b<~M(rXMUyv6*!HsXs_Y)X8IqT`M~h3a302@8FfW~jf7PatlN
zzL!CK?c{qZ-xd141@KjnLm>H4T7!rDrT_I_9N2SsrYgUO{V({&>*I`%`tU=H%Xb~B
zP7Z!49%-+{b6Vq*`~L^PDNb20bRqcpk@lZFj?=~ej`okJ<1Hp~jcKa({$9IGo>vcm
z2h`;G;10<AN%JS78#p=6XMhK$m?ztSN7Uka|45|Y0v-kKpFbw>`D)_5n8AcSz!%Vb
z;P;}H@m}%|E>?0CAm#r<`%ixF(u4=+s&hQPvJM>6{=%M+-_`is`hDy=HpL+qVD*!A
zSQuZ0KgA>SLGW(^r+)CacaFxFD9iW0oM+r$&PCu;-MhV~am2~}qtA+{{2t?@j7xhT
zO;gSaI7B6Ak6Z_Q%KJEbXKGJJB4yi^YQNoM(<PXZ86L)s+kPh%x9xl>k4re*lx0Rn
z?14h5KV7horpvZQGi9gZRF51nGAf%Z=LYf>Cs($eAv;qj6>}A^vLzv9ol?1Cr>i3>
zQyLmB<eXgA*t%s~d}=2f>sH=Qm&@s6cCP4@kEtW&^ia;uR)>a;f#T70C=IT*-Mufd
zD`_WpchQ}qjZ0KJX)$PZ?NfHwOS==hdOBgFcGSt)MnK<6D(Rs;-QD|>y>@S+Bb7v{
zxop}=E4yb8t`D>MqFt@zvP$0}qScj>J(w<L3pr(H3wAkIC}nWvNEeMxK4TB(fulp^
z9?~@RwIg3O+IH`*&U)-ri+e!{N`Ivy`N<chbRo(m@dYMdZ)Pf0cep${buS9^U4Qxm
z`A_a<8>>`C<=Bvu?uT^Bt{jwHzKGc|tc+sG$r*``o;GY&lrd1O8iVP|pfa+@iXgkv
zDZ3Wl@H8kkZ0OQ75jZzoaFn5^q=B1V<aPUua!C)8ksIU*GnfTeG?(EHzRQq23QiB@
zGpMzMvhZW*3f#gl2+F`59>TozykY-cmiG5}m9eI{N%mp#e*@XyvswE}p5!xln(+u<
z_G|KglPGN7B;RAf+L3vHJ+$y;Unl?1S;daRll{8zw<AMqyYSBiO=xt!&_bPcg+7N+
zJB7cLaa!j?c!V$e#2A4{7hO^Rr82yU)_Xb=2w(P-x0x^JEs0<JL>>g6&KRQ0zVjjT
zO|FdY(8)*QXIKp&LuCtJ_NQ^KP|h_{zwo8~pJjdr7bxeXK_*y?lS*eXKmYT<s85>k
zP?GiR0`ukk<yzfXB~S7w9xq?^#n+i{l9MOVevgvKQ^<SyvVV(Ehavr%jGiPsfxd{0
zmoMkwo7^Bd4~jpBC8|2Zd|6Y+noMmQW4_;Cbdg_UzKoyj+vWd<DP7vckMIQfwvR9S
zdy`&DB-7V^89&#m)DMvf<KgL6KL^PF6aD=qe33r}m-bS^m-E8Ae6b*YaM4M0kv{`U
zT_t=uSIGZs<^Qrgob~x9as3KhYNGJv{4vHGJn@5zPExPP-vIUUmF%OK7-OCY;fcKA
z<IDam#{B8(m-606hRTxoWxr-JQR)$Y-*Bow!a$fmPT>y<k)`mxQs$o5_4{1^Ql7_j
p@6(1y;*swMy&n?0mw$P&tL^m_F7=A<{Au_RzK9wVN0xs6zW|O6iDdu)

literal 0
HcmV?d00001

diff --git a/week-6/C++/main.cpp b/week-6/C++/main.cpp
index e69de29..f92b52e 100644
--- a/week-6/C++/main.cpp
+++ b/week-6/C++/main.cpp
@@ -0,0 +1,105 @@
+// Hezekiah Branch
+// IBM Blue Movement
+// Week 6 Submission
+
+#include <iostream>
+#include <string>
+#include <algorithm>
+#include <bits/stdc++.h> 
+
+using namespace std;
+
+/*
+Find Maximum Difference Between a Node and its Descendants in a Binary Tree. https://ibb.co/563hJSG
+
+Write an algorithm to print leaf to root path for every leaf node of the binary tree. https://ibb.co/G7sZnDZ
+
+Write an algorithm to convert a tree to its mirror. https://ibb.co/H40dhCt
+*/
+
+// Definition for a binary tree node.
+ struct TreeNode {
+      int val;
+      TreeNode *left;
+      TreeNode *right;
+      TreeNode() : val(0), left(nullptr), right(nullptr) {}
+      TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+      TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+};
+
+// Source for optimization:
+// https://www.youtube.com/watch?v=xqS8dyexaNM
+// https://leetcode.com/problems/binary-tree-paths/#
+#include <string>
+class Solution1 {
+public:
+    vector<string> binaryTreePaths(TreeNode* root) 
+    {
+        vector<string> paths;
+        if (root == nullptr) {
+            return paths;
+        }
+        
+        depth_first_search(root, "1", paths);
+        cout << paths.size() << endl;
+        return paths;
+    }
+    
+    void depth_first_search(TreeNode * root, string path, vector<string> paths) 
+    {
+        path += root -> val;
+        // Check if at root
+        if (root->left == nullptr && root ->right == nullptr) {
+            paths.push_back(path);
+            return;
+        }
+        if (root -> left == nullptr) {
+            depth_first_search(root -> left, path + "->", paths);
+        }
+        if (root -> right == nullptr) {
+            depth_first_search(root -> right, path + "->", paths);
+        }
+    }
+};
+
+class Solution2 {
+    // Soure from Techie Delight
+    public:
+    void mirror_tree(TreeNode * root) {
+        if (root == nullptr)
+            return;
+        mirror_tree(root -> left);
+        mirror_tree(root -> right);
+        swap(root->left, root -> right);
+    }
+
+};
+
+class Solution3 {
+    // Maximum Difference
+    public:
+    int maxAncestorDiff(TreeNode* root) {
+        if (root == nullptr) {
+            return 0;
+        }
+        int left = maxAncestorDiff(root -> left);
+        int right = maxAncestorDiff(root -> right);
+        if (left > right) {
+            cout << left;
+        } else {
+            cout << right;
+        }
+        return left;
+    }
+
+};
+
+// View solution
+int main() 
+{
+    Solution1 solution1;
+    Solution2 solution2;
+    Solution3 solution3;
+
+    return 0;
+}
\ No newline at end of file