jeyrschabu
diff --git a/‎assets/InOrderTraversalBinaryTree.jpg
29.8 KB b/‎assets/InOrderTraversalBinaryTree.jpg
29.8 KB
diff --git a/‎binary_search_trees.md
+4-3 b/‎binary_search_trees.md
+4-3
@@ -3,10 +3,12 @@ Binary Search Tree
 
 NOTES:
 - BST property is such that a node's left subtree value is always at most its value
-Node x, left(x) =< x. Also right(x) > x
+- Node x, left(x) =< x. Also right(x) > x
 
 Implementations:
 
+
+
 ```
 class Node<V> {
     Node parent;
@@ -23,9 +25,8 @@ class Node<V> {
 ```
 
 [INORDER TREE WALK]
-NOTE:
-In order tree traversal. Prints sorted tree nodes using the BST property
 
+![alt text](assets/InOrderTraversalBinaryTree.jpg "Inorder traversal")
 ```
 void inorder(Node node) {
     if (node != null) {