Recursion & Backtracking ~ Karun Karthih QD fowe oy two @ Subsen @ fou thre @® Combination sum fi fowu q four N-Queu T Subsesa iD lays ere Lill corrkinatiow 5} 0. phonenuirbsDm Recursion ® Length of an array 9 Low. ea IQ © @ @ o '2 3 4 i Tee ot) Sc= 06n). = - \ Oy 124 eth 4 ® © Powerof2 —> A = RAL a, 2 (9 wir 5 oy @® T 4224 GG), ) F & AF (race F) 82 (9) F % *axOr Tex OCI.) 1 then Ruan (UL —Linbed List - Karun Karthik tents Contents 0. Introduction 1, Reverse a Linked List 2. Middle of Linked List 3. Delete node in a Linked List 4, Merge two sorted Lists 5. Add two numbers 6. Add two numbers IT 7. Linked List Cycle 8. Linked List Cycle II 9. Remove Nth node from End of List 10. Palindrome Linked List 11, Remove duplicates from sorted List 12. Swapping nodes in Linked List 13. Odd Even Linked List 14. Swap Nodes in Pairs 15. Copy list with Random Pointer 16. Reverse Nodes in K-group 17. Design Linked List 18. Sort List https://www.linkedin.com/in/karun-karthlkcLinked Lik Kinksalise in Lina date Arliss , wihicn conaies Go poup Sf vi — [ot] Jnr Yon) [ou] 1 Dynamic notin. 2. Optimad snawhion | dulshon S. Stacky ond quaw can be 4. No rina maton. Rook Life Aepliabions 1 Prusious t¢ mur pope th browser 2, dmage Vier Ten 1 dingy Kinane 8. Doubly Linkudlibk ARENSON. “CERT a Disadvantages 1, Mone dus teas pil 2. low Bowens compared fo ow 3 No Runtie Bavedel in 40 Janka Liste 4 Mo mandom ecu 5 Musis player 2 Giulat Linkdlir a 4 Doubly caulon Liat AES oS. oR hnttps://mww-linkedin.com/in/karun-karthikad — > AS CUM poink to NULL, CHOOOQ © we machd ot of Linuddite > Retirn Pry oo ww the Ataaring pointin 6 ruvetbed Lise https:// wwwlinkedin.com/in/karun-karthikhrees.- Part 1 ~ Kawun Karthil Contents 0. Introduction |. Max depth of Binary tree 2. Max depth of N-ary tree 3, Preorder of binary tree 4, Preorder of N-ary tree 5. Postorder of binary tree 6. Postorder of N-ary tree 7. Inorder of Binary tree 8, Merge two binary trees 9, Sum of root to leaf paths 10, Uni-valued Binary tree 11, Leaf similar trees 12, Binary tree paths 13, Sum of Left leaves 14, Path sum 15. Left view of Binary tree 16. Right view of Binary tree 17, Same tree 18. Invert Binary tree 19, Symmetric tree 20. Cousins of Binary treeTrees tohy fut Tree - collection of tree-nodes 1, Hinox 4 © Class Frunode dobe (oma) list child 2 Binary Tree — atmost 2 childsun (0, 1,2.) ypu ao © bea © Fut Bin ® Gmptea Binany Fre bye way hod how Ls oa tases aus comleSty Ord widun filled excapr lot one & QQ g ) @ @& @ @® © & @ ©© é © Pagece Binary Fer inlunod Steuaed Biradg Free bow 4 . ae ®: und for nding hing tompleriry) hos catty & chitdan Ly aul nodes hawt Gy & titra one oF mo did «Trees. - Part2 - Kan Karthih Contents 21. Print all nodes that do not have any siblings 22. Allrnodes at distance K in a Binary Tree 23, Lowest Common Ancestor 24, Level order traversal in Binary Tree 25. Level order traversal in N-ary Tree 26. Top view of Binary Tree 27. Bottom view of Binary Tree 28. Introduction to Binary Search Tree & Search in a BST 29, Insert into a BST 30. Range Sum of BST 31, Increasing order search tree 32. Two Sum IV 33, Delete Node in a BST 34, Inorder successor in BST 35, Validate BST 36, Lowest Common Ancestor of BST 37. Convert Sorted Array to BST 38. Construct BT from Preorder and inorder traversal, 39, Construct BT from inorder and Postorder traversal 40. Construct BST from Preorder traversal https://mww linkedin. com/infkarun-karthik-5a0794187/Dt @) = Prinr at nods thar donot hove ony Siblings T= Otn) s > lr) ae ene node, chek. if both Grancus eulir —> Hun colt both af Chum Suuuruinly omy Lage Granth uur — thun cou Like brands reoutsivey only Nghe fpranth wuar — thin coll pees Sucutaivdy https://www.linkedin.com/in/karun-karthik-5a0794187/>< @ OSAHUB A= atatatea” 3 fy g (yar aol. 9xX @ DSA HUB < dsa-hub netlfy.app Contents x ° LJ a 8 Recursion & Back-tracking Trees -1 Trees - 2 Linked ListApplication link in the comments section