Skip to main content

Binary search tree in cpp

Binary Search Tree is a rooted binary tree. Its subtrees have certain properties. Each element of the binary tree is a node that has mainly 3 fields,

  1. data or element field
  2. left link 
  3. right link
For each node in a binary search tree, the data of the left node is less than the parent node and data of the right node is greater than the parent node.




It can be seen in the image above that the data in the left child node is less than the data of the parent node and data of the right child node is greater than the parent node.

There are a lot of advantages of using the binary search tree data structure, they are related to searching, sorting, using them as priority queues, etc.

To know more about binary search tree click here.

The following program has the following operations implemented
  1. isEmpty() : method that checks if the tree is empty.
  2. getRoot() :  method that returns the root element of the binary search tree.
  3. insert() : Insertion in Binary search tree.
  4. search() : Method for Searching a element in BST.
  5. height() : Method to find the height of the binary search tree.
  6. displayInorder() : Method that displays Binary search tree in Inorder form.
  7. displayPostorder() : Method that displays Binary search tree in Postorder form.
  8. displayProorder() : Method that displays Binary search tree in Preorder form.
  9. displayLeafNodes() : Display the Leaf nodes of the Binary search tree.
  10. Max() : method that returns the largest element of the tree.
  11. Min() : method that returns the smallest element of the tree.
  12. commonAncestor() : method that displays that common ancestor of the two elements.
  13. displayNodesAtDistance() : method that displays nodes at a distance k from the root node.
  14. deleteElement() : method to delete a element from the binary search tree.
  15. deleteMax() : method to delete the largest element of the tree.
  16. deleteMin() :   method to delete the smallest element of the tree.


Comments

Popular posts from this blog

Infix to Prefix conversion using Stack

This post is about conversion of Infix expression to Prefix conversion. For this conversion we take help of stack data structure, we need to push and pop the operators in and out of the stack.

Infix expressions are the expressions that we normally use,eg. 5+6-7; a+b*c etc. Prefix expressions are the expressions in which the 2 operands are preceded by the operator eg. -+567 , +a*bc etc.

This method is very similar to the method that we used to convert Infix to Postfix but the only difference is that here we need to reverse the input string before conversion and then reverse the final output string before displaying it.

NOTE: This changes one thing that is instead of encountering the opening bracket we now first encounter the closing bracket and we make changes accordingly in our code.

So, to convert an infix expression to a prefix expression we follow the below steps
(we have 2 string, 1st is the input infix expression string 2nd is the output string which is empty initially)


We first revers…

Hashing with Quadratic Probing

Hashing is a technique used for storing , searching and removing elements in almost constant time. Hashing is done with help of a hash function that generates index for a given input, then this index can be used to search the elements, store an element, or remove that element from that index.

A hash function is a function that is used to map the data elements to their position in the data structure used. For example if we use an array to store the integer elements then the hash function will generate position for each element so that searching, storing and removing operation on the array can be done in constant time that is independent of the number of elements in the array. For better look at the example below.



now we face a problem if for 2 numbers same position is generated example consider elements 1 and 14

1 % 13 = 1

14 % 13 = 1

so when we get 1 we store it at the first position, but when we get 14 we see that the position 1 is already taken, this is a case of collision.

Inorder…

Home Page