https://github.com/harisali-git/bst_iterativeinsert

This code is for the iterative insert in the Binary Search Tree
https://github.com/harisali-git/bst_iterativeinsert

Last synced: about 1 year ago
JSON representation

This code is for the iterative insert in the Binary Search Tree

• Host: GitHub
• URL: https://github.com/harisali-git/bst_iterativeinsert
• Owner: HarisAli-git
• License: mit
• Created: 2021-09-09T09:42:50.000Z (almost 5 years ago)
• Default Branch: main
• Last Pushed: 2021-09-09T09:46:07.000Z (almost 5 years ago)
• Last Synced: 2025-03-09T22:41:26.193Z (over 1 year ago)
• Language: C++
• Size: 2.93 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# BST_IterativeInsert

Normally the insertion in a Binary Search Tree is done by recursion so these few lines of code show that how to achieve the same task by a loop instead of using a recursion. The code seems a bit complicated at first glance but there is just basic things like checks that are getting handeled in this code.