- What is BST or Binary Search tree?
- Implementing BST in C ( header file ) BST / Binary Search
- Deleting a node
- tree1.h fully updated
- Given a binary tree,create the copy of the tree.
- Given a binary tree, count the number of nodes in the tree.
- Given a binary tree, find the maximum depth the number of nodes along the longest path from the root node down to the farthest leaf node.
- isBst–Whether the tree provided is BST or not
- Count trees–Given N nodes, how many structurally
- Write a code to find the minimum and maximum value in binary search tree
- Print the paths in binary search tree from root to leaves.
- Check whether binary tree are same or not?
- Get the mirror of Binary tree
- BST : Binary search tree with double tree
- Print the post order of binary search tree in cpp
- BT: How to check whether 2 trees are same or not?
- BST: How to check whether 2 trees are BST or NOT
- Construct a tree given its inorder and preorder
- Given an expression tree, calculate the expression
- Getting the size of Binary Search Tree (cpp)
- Create Copy of a tree (cpp)

**Traversal**

- Print the post order traversal (recursive)
- Print the BST in increasing order…to put this in different way, it simply means to print in inorder traversal
- Find Diameter of Binary Tree
- Duplicate removal in Binary Search Tree
- Morris Traversal - Inorder Tree Traversal without recursion and without stack
- Find nth largest value in a BST
- BST : Improving search by using sentinel
- Print binary search tree in increasing order
- Find the minimum data value find in Binary Search
- Compute Maximum depth of binary search tree in cpp
- Print the binary tree in zigzag level order
- Construct a tree given its inorder and preorder traversal. Similarly construct tree for inorder and postorder traversal
- Given an expression tree, evaluate the expression and obtain the paranthesized form of expression.
- Find the closest ancestor of two nodes in a tree
- Threaded binary tree Algorithms
- DFS and BFS on tree.
- Iterative traversal (pre, post and inorder) of tree
- Binary search tree BST / Binary Search Tree
- Breadth first search (BFS) or Level order Traversal
- BST:Return Nth Node in in-order traversal