কম্পিউটার কোডিং

Binary Search Tree - BST implementation # include < stdio.h > # include < stdlib.h > typedef struct tree { int number; struct tree *leftChild; struct tree *rightChild; } node; node *root= NULL ; void insertNode ( int value); void searchOnTree ( int value); void preOrderPrint (node *rootNode); void inOrderPrint (node *rootNode); void postOrderPrint (node *rootNode); int main () { insertNode ( 45 ); insertNode ( 54 ); insertNode ( 40 ); insertNode ( 49 ); insertNode ( 38 ); insertNode ( 70 ); insertNode ( 30 ); insertNode ( 39 ); insertNode ( 41 ); insertNode ( 45 ); insertNode ( 44 ); printf ( " \n Pre-Order Tree printing: \n " ); preOrderPrint (root); puts ( " " ); printf ( " \n In-Order Tree printing: \n " ); inOrderPrint (root); puts ( " " ); printf ( " \n Post-Order Tree p...