Binary Tree Sep 24, 2017

    //In-Order traversal
    void inOrderTraversal(TreeNode node)
    {
        if(node != null)
        {
            inOrderTraversal(node.left);
            visit(node);
            inOrderTraversal(node.right);
        }
    }
    //Pre-Order traversal
    void preOrderTraversal(TreeNode node)
    {
        if(node !=null )
        {
            visit(node);
            preOrderTraversal(node.left);
            preOrderTraversal(node.right);
        }
    }
    //Post-Order traversal
    void postOrderTraversal(TreeNode node)
    {
        if(node !=null )
        {
            postOrderTraversal(node.left);
            postOrderTraversal(node.right);
            visit(node);
        }
    }

Binary Heaps Sep 24, 2017

Feature: Each node is smaller than its children. The root is the minimum element in the tree.

Two key operations
• Insert:
Insert the element at the right bottom, then compare with its parent and move the node upper.
• Extract Minimum Element:
Remove the element in the root, move the last element to the root, bubble down this element if it is bigger than its children. If both of its children are smaller than it, swap with the smaller one.

Trie Jan 21, 2018

• Used for word searching and prefix searching
• Question
• Tutorial