Skip to main content

[Tree]..Is parent or grandparent?

There are two nodes given in a tree(not binary tree). Find whether one node
is parent/grand parent of other.
order should be O(1).

tag root as 0 , tag left child as 00 , right child as 01.
left child's left child as 000 , left's child's right child as
001 ... and so on.
now
let input be tags t1 and t2
if( (t1 == (t2>>1)) || (t2==(t1>>1)))
return child parent relationship
if( (t1 == (t2>>2)) || (t2==(t1>>2)))
return child grand-parent relationship ...


This solution can take a lot of space as the three grows.

We can tag the node by number ..
Root -0
1 -2-3-4

SO given two node get their tags..
Get Max of both t1, t2.
Go for parent of that node if other node then return or check for parent of parent and check again for other node.

With 2^32 value avaialable for indexing ..u wont run out of values.

Comments

Post a Comment

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part
3 comments
Read more

JDBC connection factory

  Class ConnectionManager {   Queue<Connection> availableConnection;   List <Connection> allotedConnection; ConnectionManager( Integer noOfConnections, ConnectionPoperties props ) {     //Create the no of connection objects and assign to avaialbleConnection } Conection getConnection() {     syncronized( this.class) { if (availableConnection.isEmpty() ) {          throw ConnectionExhausted();       }       conn = availableCOnnection.poll();       alottledConectiion.add(conn); } return conn; } synchronized Conection releaseConnection(Connection conn) {        alottedconnection.remove(conn);    avaialbleConection.add(conn); }
Post a Comment
Read more

Median of Five Numbers

U have 5 NOs , X1,X2,X3,X4,X5 With minimum no. of comparisons we have to find a median. SWAP(X,Y) function is available to u . I have a answer of six comparisons and eight swaps....wait for people to find out by themselves.
1 comment
Read more