# Binary Search Tree and Traversals

Class Bst implements Binary Search tree and tree traversal algorithms

Structure of each node is defined in class Node.

Methods/ Operations Implemented:

	public void insert(int value) - Inserts a new Node with specified value in the BST

	public void inOrder() - Prints In Order traversal of tree.

	public void preOrder() - Prints Pre Order traversal of tree.

	public void postOrder() - Prints Post Order traversal of tree.

	public void levelOrder() - Prints Level Order Traversal of tree.

	public Node search(int value) - Searches a Node with specified value in the tree

	public void delete(int value) - Delete Node with specified value from the BST

	protected Node findSucc(Node n) - Returns In Order successor of specified node





# Binary Search Tree and Traversals

Class Bst implements Binary Search tree and tree traversal algorithms

Structure of each node is defined in class Node.

Methods/ Operations Implemented:

	public void insert(int value) - Inserts a new Node with specified value in the BST

	public void inOrder() - Prints In Order traversal of tree.

	public void preOrder() - Prints Pre Order traversal of tree.

	public void postOrder() - Prints Post Order traversal of tree.

	public void levelOrder() - Prints Level Order Traversal of tree.

	public Node search(int value) - Searches a Node with specified value in the tree

	public void delete(int value) - Delete Node with specified value from the BST

	protected Node findSucc(Node n) - Returns In Order successor of specified node

	public boolean isValidBst() - Returns true if tree is a valid Binary Search Tree. 
								  Returns false otherwise

 
	// Empty tree (root = null) is assumed to be a valid bst.
	// Time Complexity: O(N)		N - No. of Nodes
	// Space Complexity: O(N)	

	




Update read me for bst
Update read me for bst
