BinarySearchTree

Binary Search Tree BST is a node-based binary tree data structure which has the following properties:

The left subtree of a node contains only nodes with keys lesser than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
The left and right subtree each must also be a binary search tree.

️ get more information:

Preview

 :::::::::    ::::::::   :::::::::::  
 :+:    :+:  :+:    :+:      :+:      
 +:+    +:+  +:+             +:+      
 +#++:++#+   +#++:++#++      +#+      
 +#+    +#+         +#+      +#+      
 #+#    #+#  #+#    #+#      #+#      
 #########    ########       ###      

  ------>  Trees  <------
 [0] root: 27
 [1] root: 54

  ------>  Select an item  <------
 [1] Create new tree
 [2] Graphic display
 [3] Count of nodes
 [4] Get height
 [5] Count of Chiledren
 [6] Count of leaf
 [7] Remove all nodes
 [8] Traversal
 [9] full tree
 [10] complete tree
 [11] Search
 [12] Compare two tree
 [13] Maximum and minimum
 [14] Add new node
 [15] Create copy tree
 [-1] exit

 ┌─[>> Binary Search Tree <<]
 └──╼ [#]

Install

To install, you only need to enter the following commands in your terminal

git clone https://github.com/Dark6273/binarySearchTree.git
cd binarySearchTree
python main.py

Programmer

Binary Search Tree created by Mahdi Khosravi
Telegram || Email || Phone