UMBC CMSC 202, Computer Science II, Spring 1999, Sections 0101, 0102, 0103, 0104

25. Trees

May 6, 1999

• Definitions
  • Graph = Nodes (Vertices) + Edges
  • Cycle
  • Tree
  • Rooted tree
  • External node (leaf)
  • Internal node
  • Binary tree
  • Left, right child
  • Recursive definition of binary tree
  • Perfect binary tree
  • Binary Search Tree (BST)
• Insertion of nodes into BST
• Proof:

  The number of nodes in a perfect binary tree of height h is 
  
     (h + 1)
    2         -  1