Subversion
Written by: Lorna Jane Mitchell
Featured Refcardz: Top Refcardz:
  1. Git
  2. DNS
  3. Data Mining
  4. Spring Data
  5. Subversion
  1. Spring Data
  2. Subversion
  3. Spring Config.
  4. Spring Annotations
  5. Data Mining
150+ Refcardz Available · Get them all

Link Details

Previous | Next

Surprise Me!

Link 921567 thumbnail
User 965185 avatar

By RafaelZin
via code2learn.com
Published: Feb 13 2013 / 08:38

Binary Search Tree (BST) Algorithm Tutorial
binary search tree (BST), which may sometimes also be called an ordered or sorted binary tree, is a node-based binary tree data structure which has the following properties: * The left subtree of a node contains only nodes with keys less than the node's key. * The right subtree of a node contains only nodes with keys greater than the node's key. * Both the left and right subtrees must also be binary search trees. * There must be no duplicate nodes.
Vote up
Vote down
  • 8
  • 0
  • 267
  • 489
SaveShareSend Tags: , ,

Add your comment


Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Voters For This Link (8)



Voters Against This Link (0)