https://github.com/sameetasadullah/binary-search-tree-implementation

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 BST as well
https://github.com/sameetasadullah/binary-search-tree-implementation

binary-search-tree cpp traversals tree-structure visual-studio

Last synced: about 1 month ago
JSON representation

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 BST as well

• Host: GitHub
• URL: https://github.com/sameetasadullah/binary-search-tree-implementation
• Owner: SameetAsadullah
• Created: 2022-08-05T21:25:31.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2022-08-05T22:15:26.000Z (over 2 years ago)
• Last Synced: 2023-03-10T20:47:03.026Z (almost 2 years ago)
• Topics: binary-search-tree, cpp, traversals, tree-structure, visual-studio
• Language: C++
• Homepage:
• Size: 30.2 MB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
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()