Home
Introduction
Properties
Operations
References
Quiz

CS 331
Data Structures and Algorithms
Binary Search Trees

Properties of Binary Search Trees

    1.Each node has a value.
    2.A toal order is defined on these values.
    3.The left sub tree of a node contains only values less than the node's value.
    4.The right sub tree of a node contains only values greater than or equal to the node's vaue


    A binary search tree of size 9 and depth 3,
    with root 8 and leaves 1,4,7 and 13

    Previous| Home| Next