Scribd Logo
Upload

Welcome to Scribd!

  • 102 views

    Final Exam Cheat Sheet

    Uploaded by

    sharmanator99
    The document discusses binary search trees and their operations. It explains how to insert a node into a binary search tree recursively by checking if the node value is less than or greater than the current node's value and traversing left or right. It also provides an example function to count the number of nodes by recursively traversing the tree. It discusses the time complexity of different data structures and operations like binary search trees being O(logN) and hash tables being O(1). It also covers concepts like complete binary trees, class inheritance, heap operations, and templates in C++.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Final Exam Cheat Sheet

    Uploaded by

    sharmanator99
    102 views3 pages
    The document discusses binary search trees and their operations. It explains how to insert a node into a binary search tree recursively by checking if the node value is less than or greater than the current node's value and traversing left or right. It also provides an example function to count the number of nodes by recursively traversing the tree. It discusses the time complexity of different data structures and operations like binary search trees being O(logN) and hash tables being O(1). It also covers concepts like complete binary trees, class inheritance, heap operations, and templates in C++.

    Original Description:

    CS Final Exam Cheat Sheet

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses binary search trees and their operations. It explains how to insert a node into a binary search tree recursively by checking if the node value is less than or greater than the current node's value and traversing left or right. It also provides an example function to count the number of nodes by recursively traversing the tree. It discusses the time complexity of different data structures and operations like binary search trees being O(logN) and hash tables being O(1). It also covers concepts like complete binary trees, class inheritance, heap operations, and templates in C++.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    102 views3 pages

    Final Exam Cheat Sheet

    Uploaded by

    sharmanator99
    The document discusses binary search trees and their operations. It explains how to insert a node into a binary search tree recursively by checking if the node value is less than or greater than the current node's value and traversing left or right. It also provides an example function to count the number of nodes by recursively traversing the tree. It discusses the time complexity of different data structures and operations like binary search trees being O(logN) and hash tables being O(1). It also covers concepts like complete binary trees, class inheritance, heap operations, and templates in C++.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 3

    Trees / Binary search trees:

    Moving through recursively:

    template <class KeyType, class ValueType>


    void MyMap<KeyType, ValueType>::insertNode(Node*& startingPoint, Node*&
    toBeInserted)
    {
    if(startingPoint == NULL) // the funciton has found the location of insertion
    {
    startingPoint = toBeInserted;
    }
    else
    {
    if(toBeInserted->m_key < startingPoint->m_key) // traverse down the
    left path
    {
    insertNode(startingPoint->m_leftChild, toBeInserted);
    }
    else // traverse down the right path
    {
    insertNode(startingPoint->m_rightChild, toBeInserted);
    }
    }
    }

    Some simple functions such as counting the number of nodes:

    int nodecount(node* node)


    {
    if(node == NULL)
    return 0;
    else
    {
    for(int I = 0; I < node->children.size(); i++)
    {
    int m = nodecount(node->children[i]);
    m++;
    return m;
    }
    }
    }

    Big O look for loops. For each loop you most probably are going to
    have an O(N) operation, and for nested loops that factor of N increases

    Binary search tree O(logN)


    Hash table O(1)

    A complete binary tree is a tree in which all levels are filled except the
    bottom level and its members are arranged in an order from left to
    right

    Class inheritance:
    1. Construct the base
    2. Construct the data members
    3. Execute the body of the constructor

    Similarly,
    1. Execute the body of the destructor (derived)
    2. Destroy the data members
    3. Destroy the base part

    How to manage a maxheap or a minheap:

    Insertion:
    Complete the binary tree
    Compare the newly added node to its parent node
    If greater swap them

    Deletion:
    Complete the binary tree by moving the last node to the top to
    complete tree
    Compare to both children and swap with greater of 2
    Continue to trickle down to proper place

    Heapsorting also is pretty efficient but it looks like its working in


    reverse

    A heap represented by an array

    Each parent is floor((child-1)/2)

    Each child is (2j + 1) and (2j + 2)

    Templates:

    template <class KeyType, class ValueType>


    class MyMap{stuff};

    When a function is written, you want to declare the thing again unless
    you include it in the body of the class declaration
    template <class KeyType, class ValueType>
    const ValueType* MyMap<KeyType, ValueType>::find(const KeyType& key)
    const

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy