Modules

Binary Search Linear Search Bubble Sort Insertion Sort Linked List Binary Tree Combined Algorithm Stacks Queues Js Canvas Html Modules

Other Features

Night Updates Dev Mode

Linked List

The python code is approved and is functioning properly...

Psuedocode

Currently not available. Please refer the text book for psuedocode
//There was an error in the Psuedocode for Linked List in the Text Book.
Please Refer the one in our Website...

Python Algorithm

The code is in python for this algorithm

#Coded by Revise Zone | Indenting is required
class node:
    def __init__(self):
        self.leftPointer=0
        self.rightPointer=-1
        self.Data=""
        
Tree = [ node() for i in range(10) ]
for i in range(10):
    Tree[i].leftPointer=i+1
    Tree[i].rightPointer=-1
Tree[9].leftPointer=-1

Freeptr=0
Nullptr=-1
rootptr=-1
def push(Data):
    global Freeptr
    global Nullptr
    global rootptr
    if Freeptr != Nullptr:
        CurrentNode=Freeptr
        Tree[CurrentNode].Data=Data
        Freeptr=Tree[CurrentNode].leftPointer
        Tree[CurrentNode].leftPointer=Nullptr
        Tree[CurrentNode].rightPointer=Nullptr
        if rootptr==Nullptr:
            rootptr=CurrentNode
        else:
            Checkptr=rootptr
            while Checkptr != Nullptr:
                Previousptr=Checkptr
                if Tree[Checkptr].Data>Data:
                    Turnedleft=True
                    Checkptr=Tree[Checkptr].leftPointer
                else:
                    Turnedleft=False
                    Checkptr=Tree[Checkptr].rightPointer

if Turnedleft==True:
                Tree[Previousptr].leftPointer=CurrentNode
            else:    
                Tree[Previousptr].rightPointer=CurrentNode

def find(Search):
    CheckNode=rootptr
    while CheckNode != Nullptr and Tree[CheckNode].Data!= Search:
        if Tree[CheckNode].Data > Search:
            CheckNode=Tree[CheckNode].leftPointer
        else:
            CheckNode=Tree[CheckNode].rightPointer

return CheckNode

push("A")
push("C")
push("X")
push("R")
push("Z")
push("Y")
push("D")
push("E")
push("B")
push("W")
print(find("A"))
print(find("C"))
print(find("X"))
print(find("R"))
print(find("E"))

The code is free for anyone to copy and use...The copied code must have the same code and indentation as above

Try it yourself

Download Py