sudhanshuptl

# One Way Link List
'''
1. Insertion at beginning
2. Insertion at end
3. Insertion at given postion
4. deletion from beginning
5. deletion from the end
6. deletion from given postion
'''
class Node:

sudhanshuptl

__author__='Sudhanshu Patel'
'''
Binary search tree implementation
# goes left if key less than node.key else right
1. insetion
2. Preorder
3. postorder
4. inorder traversal
5. find max depth
6. print all leaf node

sudhanshuptl

#!/usr/bin/python           # This is client.py file

import socket               # Import socket module

s = socket.socket()         # Create a socket object

host = socket.gethostname() # Get local machine name
port = 12345                # Reserve a port for your service.

s.connect((host, port))

sudhanshuptl

__author__='Sudhanshu Patel'
'''
Binary search tree implementation
# goes left if key less than node.key else right
1. insetion
2. Preorder
3. postorder
4. inorder traversal
5. find max depth
6. print all leaf node

sudhanshuptl

## Destructer delete object by itself when its reference is 0
from abc import ABC, ABCMeta, abstractclassmethod

'''
Abstract classes are classes that contain one or more abstract methods. An abstract method is a method that is declared,
 but contains no implementation. Abstract classes may not be instantiated, and require subclasses to provide 
 implementations for the abstract methods.
'''

sudhanshuptl

from abc import ABC, ABCMeta, abstractclassmethod

'''
Abstract classes are classes that contain one or more abstract methods. An abstract method is a method that is declared,
 but contains no implementation. Abstract classes may not be instantiated, and require subclasses to provide 
 implementations for the abstract methods.
'''

sudhanshuptl

/* Sudhanshu Patel -sudhanshuptl13@gmail.com */
#include<stdio.h>
#include<stdlib.h>


struct Node{
    int data;
    struct Node *next;
};
typedef struct Node Node;

sudhanshuptl

__author__ == 'Sudhanshu Patel'
'''
1. Height should be h or h-1
2. max heap : parent node have hire value than all of its children

'''

class Heap_Array(object):
    # Array Implementation of max Heap
    # parent of a node is (i-1)/2 and child of a node is 2*i+1 and 2*i+2

sudhanshuptl

/* Sudhanshu Patel sudhanshuptl13@gmail.com */
/*
Min Heap implementation in c
*/
#include<stdio.h>
#include<stdlib.h>
/*
 Array Implementation of MinHeap data Structure
*/

sudhanshuptl

#include<stdio.h>
#include<string.h>

int main(){
    FILE *fp; //file pointer
    char line[30];
    char *token;

    //open file