inorder traversal funtion

This is a discussion on inorder traversal funtion within the C++ Programming forums, part of the General Programming Boards category; How would one execute an inorder traversal function for a binary search tree, that permits visit to delete the node ...

  1. 04-20-2009 #1
    timmy123
    timmy123 is offline
    Registered User
    Join Date
    Apr 2009
    Posts
    1

    inorder traversal funtion

    How would one
    execute an inorder traversal function for a binary search tree, that permits visit to delete the node visited.
  2. 04-20-2009 #2
    bithub
    bithub is offline
    Registered User
    Join Date
    Sep 2004
    Location
    California
    Posts
    3,242
    Are you having problems with traversing the tree, or with the deletion?
  3. 04-20-2009 #3
    hk_mp5kpdw
    hk_mp5kpdw is offline
    Registered User hk_mp5kpdw's Avatar
    Join Date
    Jan 2002
    Location
    Northern Virginia/Washington DC Metropolitan Area
    Posts
    3,672
    Are you talking about a simultaneous in-order traversal with deletion of the nodes as they are visited?
    I used to be an adventurer like you... then I took an arrow to the knee.
« Previous Thread | Next Thread »
Popular pages Recent additions subscribe to a feed

Similar Threads

  1. String as the name of bin. tree node/root + inorder traversal question
    By bbanelli in forum C Programming
    Replies: 5
    Last Post: 11-17-2007, 02:47 PM
  2. Filtering inorder bst print traversal
    By wuzzo87 in forum C Programming
    Replies: 6
    Last Post: 09-29-2006, 08:34 AM
  3. Request for comments
    By Prelude in forum A Brief History of Cprogramming.com
    Replies: 15
    Last Post: 01-02-2004, 09:33 AM
  4. using traversal pairs to build a tree
    By Unregistered in forum C++ Programming
    Replies: 0
    Last Post: 05-06-2002, 11:51 PM
  5. InOrder traversal : show tree
    By sballew in forum C Programming
    Replies: 4
    Last Post: 12-17-2001, 09:38 PM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21