AWS Data Pipeline Services

https://www.youtube.com/watch?v=tykcCf-Zz1M

  • Breadth First Algorithm
    Breadth First Algorithm OR Level wise printing of a BST: /* Breadth first traversal using queue */ void BreadthFirstTraversal(Tree *root)...
  • Max Contigous subsequence sum
    Given n numbers, find out i and j where 1<=i<=j<=n, where the sumof elements from i to j is maximum. All positive : Sum of all ele...
  • Convert a tree to array
    Here is the simple code for converting a BST to array of numbers: /* Converting a BST into an Array */ void TreeToArray(struct Tree *node...