Day-61 One DP problem and finished chap 2 of CTCI2

Author: mandliya

tree_problems/.verticalSum.cpp.swp

@@ -0,0 +1,50 @@
+/**
+ * Given a sorted array, convert it balaned binary search tree.
+ */
+
+#include<iostream>
+#include<vector>
+
+struct Node {
+	int data;
+	Node * left;
+	Node * right;
+	Node( int d ) : data{ d }, left{ nullptr }, right{ nullptr } { }
+};
+
+Node * sortedArrayToBST( std::vector<int> & arr, int start, int end ) {
+	if ( start > end ) {
+		return nullptr;
+	}
+	int mid = ( start + end )/2;
+	Node * node = new Node(arr[mid]);
+	node->left = sortedArrayToBST( arr, start, mid - 1 );
+	node->right = sortedArrayToBST( arr, mid + 1, end );
+	return node;
+}
+
+void printArray( std::vector<int> & arr ) {
+	for ( auto i : arr ) {
+		std::cout << i << " ";
+	}
+	std::cout << std::endl;
+}
+
+void printTreeInOrder( Node * root ) {
+	if( root ) {
+		printTreeInOrder( root->left );
+		std::cout << root->data << " ";
+		printTreeInOrder( root->right );
+	}
+}
+
+int main() {
+	std::vector<int> arr{ 1, 2, 3, 4, 5, 6, 7, 8 };
+	std::cout << "Arr  :";
+	printArray(arr);
+	Node * root = sortedArrayToBST(arr, 0, arr.size() - 1);
+	std::cout << "Tree :";
+	printTreeInOrder(root);
+	std::cout << std::endl;
+	return 0;
+}

tree_problems/run

@@ -4,11 +4,11 @@
  * An empty tree is SumTree and sum of an empty tree can be considered as 0.
  * A leaf node is also considered as SumTree.
  *
- *					26
- *				/   \
+ *			 26
+ *			/   \
  *		  10     3
- *		 /    \     \
- *	  4      6      3
+ *		 /   \     \
+ *	   4      6      3
  */
 #include <iostream>
 
@@ -63,10 +63,10 @@ void inorder(Node * root)
 int main()
 {
 /**
-  *					26
-  *				/   \
+  *			  26
+  *			/   \
   *		  10     3
-  *		 /    \     \
+  *		 /   \     \
   *	  4      6      3
   */
   Node * root = new Node(26);