Thursday, February 5, 2009

Tree Data Structure

  1. First we create the root of the tree.
  2. The root has three children, so lets add them: node0, node1, node2
  3. Now the root’s second child (’node1′) has children by itself namely: node3, node4
  4. The ('node1') first child has a children by itself namely: node5, node6
  5. Finally we want to add a child (‘node7′) under the root's third node ('node2').
  6. We can use proning to delete data.


0 comments: