DSA/trees/README.md

# Trees

### C or C++

1. [Pre, In & Post Order Traversals](c-or-cpp/pre-in-post-traversal.cpp)
2. [Level Order Traversal](c-or-cpp/level-order-traversal.cpp)
3. [Build Binary Tree using Pre,In & Post Order](c-or-cpp/build-binary-tree.cpp)

### Java

1. [Pre, In & Post Order Traversals](java/pre_in_post_traversal.java)
Added 3 basic traversals in Binary Trees (#144) * added max subarray sum * added pre,in,post traversals * Update pre-in-post-traversal.cpp formatted the output * Update pre-in-post-traversal.cpp formatted output Co-authored-by: Arsenic <54987647+Arsenic-ATG@users.noreply.github.com> 2021-04-09 12:52:11 +00:00			`# Trees`

			`### C or C++`

			`1. [Pre, In & Post Order Traversals](c-or-cpp/pre-in-post-traversal.cpp)`
Added level order traversal in Binary trees (#153) * added max subarray sum * added pre,in,post traversals * Update pre-in-post-traversal.cpp formatted the output * Update pre-in-post-traversal.cpp formatted output Co-authored-by: Arsenic <54987647+Arsenic-ATG@users.noreply.github.com> 2021-04-10 09:11:47 +00:00			`2. [Level Order Traversal](c-or-cpp/level-order-traversal.cpp)`
Added build Binary Tree function in Cpp (#160) * added max subarray sum * added pre,in,post traversals * Update pre-in-post-traversal.cpp formatted the output * Update pre-in-post-traversal.cpp formatted output * added build binary tree function Co-authored-by: Arsenic <54987647+Arsenic-ATG@users.noreply.github.com> 2021-04-13 15:00:41 +00:00			`3. [Build Binary Tree using Pre,In & Post Order](c-or-cpp/build-binary-tree.cpp)`
Add trees pre in post traversal java (#178) * add pre, in and post traversal trees in java * Update README.md * update line 49 to pass lint test change "System.out.print("\n\nin order: "); to System.out.println("\n"); System.out.print("in order: "); 2021-04-14 15:31:22 +00:00
			`### Java`

			`1. [Pre, In & Post Order Traversals](java/pre_in_post_traversal.java)`