Skip to content

Latest commit

 

History

History
20 lines (18 loc) · 756 Bytes

README.md

File metadata and controls

20 lines (18 loc) · 756 Bytes

Binary Search Tree Implementation

Description

My own Templatized C++ Implementation of Binary Search Tree and its Different Traversals i.e, PreOrder, PostOrder, InOrder using Microsoft Visual Studio. You can also check the Type of Binary Search Tree as well i.e, full binary tree, perfect binary tree etc. The code is based on an example of User Accounts Record Class and inserting on the basis of User Account ID but you can modify it as per your requirement.

Functions

  • getRoot()
  • insert()
  • retrieve()
  • isEmpty()
  • getHeight()
  • remove()
  • inOrderDisplay()
  • preOrderDisplay()
  • postOrderDisplay()
  • FullBinaryTree()
  • PerfectBinaryTree()
  • CompleteBinaryTree()
  • BalancedBinaryTree()
  • DegenerateTree()