First run the Menu.py file to start.
!!!HELLO TO BINARY TREE!!!
CHOOSE AN OPTION
1-BINARY SEARCH TREE (BST)
2-MIN HEAP
3-MAX HEAP
4-EXIT
-->
choose an option:\
INSERT A BST
ENTER THE NUM OF NODES
-->
then enter numbers of node
then enter each node:
ENTER NUM
-->like this:
___64_
/ \
4 454
\
7_
\
24
INSERT A MIN HEAP
ENTER NUM OF ELEMENTS
-->ENTER NUM
--> __2_
/ \
_54_ 78
/ \
464 64
INSERT A MAX HEAP
ENTER NUM OF ELEMENTS
-->ENTER NUM
--> ___2222__
/ \
___886_ 778_
/ \ / \
255_ 64 8 456
/ \
15 55other usage of this code you can convert an array of binary tree into a doubly linkedlist
by MKnode.py .
array = [1, 2, 3, 4, 5, 6, 7]
#set the first index as root
doubly_linked_list = Node(array[0])
doubly_linked_list.convert_array_to_doubly_linked_list(array)
#also can display this array by
doubly_linked_list.display()
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent