+ Reply to Thread
Results 1 to 2 of 2

Thread: Find nodes which has min difference

  1. 9th December 2010, 09:33 #1
    Surfer
    Surfer is offline Senior Member
    Join Date
    Mar 2010
    Posts
    321

    Find nodes which has min difference

    Given a binary Search Tree containing numbers, Find two nodes whose difference in minimum.
    Digg this Post!Add Post to del.icio.usBookmark Post in TechnoratiFurl this Post!
    Reply With Quote Reply With Quote
  2. 9th December 2010, 09:36 #2
    Surfer
    Surfer is offline Senior Member
    Join Date
    Mar 2010
    Posts
    321
    Do not use other data structure to store and sort the values.

    Hint: Find next node for each node and take the difference.
    Digg this Post!Add Post to del.icio.usBookmark Post in TechnoratiFurl this Post!
    Reply With Quote Reply With Quote
+ Reply to Thread
« Divide two numbers without using division operator | Find Pythagorean triplet in an array »

Thread Information

Users Browsing this Thread

There are currently 1 users browsing this thread. (0 members and 1 guests)

Similar Threads

  1. Find minimum distance between two nodes of a binary tree
    By Surfer in forum Adobe
    Replies: 0
    Last Post: 26th September 2010, 08:33
  2. Find nodes with longest distance in Binary Tree
    By Surfer in forum Amazon
    Replies: 4
    Last Post: 12th July 2010, 11:30
  3. find the difference
    By TopGun in forum Amazon
    Replies: 1
    Last Post: 2nd July 2010, 04:32
  4. Find number of possible unique trees of n nodes
    By TopGun in forum Algorithm/Data Structure Questions
    Replies: 1
    Last Post: 23rd April 2010, 11:10

Tags for this Thread

Bookmarks

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts

Forum Rules