Monday, 14 January 2019

ADS:Unit-1 Trees



Contents: 


Tree- basic terminology, General tree and its representation, representation using sequential and linked organization, Binary tree- properties, converting tree to binary tree, binary tree traversals- inorder, preorder, post order, level wise -depth first and breadth first, Operations on binary tree. Binary Search Tree (BST), BST operations, Threaded binary tree- concepts, threading, insertion and deletion of nodes in in-order threaded binary tree, in order traversal of in-order threaded binary tree. Case Study- Use of binary tree in expression tree-evaluation and Huffman's coding


                                   Video Link: https://youtu.be/KofWhRQrWdc

No comments:

Post a Comment

Stack and Queue as ADT in C++

Stack as ADT The functions associated with stack are: empty()  – Returns whether the stack is empty size()  – Returns the size o...