FINDING THE LARGEST NODE IN A BINARY TREE

can anybody help me with a recursive function to find the LARGEST NODE IN A BINARY TREE if you are given the following specs. PLEASE NOTE THAT IT'S A BINARY TREE NOT A SEARCH TREE.
Public class Node {
Node left;
Node right;
int val;
int Largest(Node r){
}

Naah, just studying and thinking it's an interesting
task Well, I diagree.
since each time the recursive function is
called, variables you hve in the method will be over
written with the new recursive call.So what? For variables that are valid inside the scope of the method: that's how it supposed to be. Vor variables with a larger scope: hand them over as an additional argument.

Similar Messages

How to Find the Latest Version of Cluster Binary Files available at Microsoft website

How we can find the latest version of Cluster binary files available for download at Microsoft Website and which Cluster Binaries should be update to make the Cluster services stable healthy.

@AnatolySV : I believe you need to put some efforts to understand what he is asking.
You may find the latest version of Cluster Binaries by entering the required keywords for Microsoft Failover Clustering. Some of the main Cluster binaries(Keywords) are:-
Clusres.dll (For Cluster Resources like Disk, Application or Service, Cluster IP)
Clussvc.exe (Cluster Service)
TCPIP.sys (If the Storage is presented to the cluster Nodes via ISCSI Network).
MPIO.sys / ISCSIprt.sys (If we are using Multipathing for the disks to be presented).
RHS.exe (Resource Host Subsystem)
So, the Answer to your question is: You need to enter the binary name "Clusres.dll" and mention the Operating System you want to install your binaries to "Windows Server 2008 R2 Sp1" on Bing (Preferred for Microsoft Hotfixes). In Result you will get the
list of hotfixes for clusres.dll
You need to try this multiple times in order to get the latest version as Microsoft does not have a single Link.
Hope this answers your query. Feel free to leave a message incase you need more help.
Maybe)
But hey, you`ve got +1 from me for clarification)
Anyway, I still think that the initial question could be more clear and exact.

How to remember the path while traverse a binary tree?

Hi, again, I have difficulty handling tree search problems.
The quesion is How to search for a node from a binary tree A, return true if found meanwhile generate the path which can be used to locate the node.
I think the signature should be:
// The path contains only 0s and 1s. 0 means go left and 1 means go right.
public staic boolean search(Node rootOfA, Node b, ArrayList<Integer> path){
// the class Node only has two fields:
Node{
Node left;
Node right;
I know if there is another field in the Node class (say, a flag), the quesion would be much easier, but the space is really critical.
I tried to use recursion but havn't got a correct solution. I am thinking of usinga non-recursion algo.
Anyone wants to help?

Hi, JosAh,
That's mind provoking. However, I do think it works. It does not pop some stuff it should pop. I tested it over a very simple tree and it failed. Did you test it? I might be wrong...
The tree I am working on does not have null pointers, the condition to test if a node is a leaf is if(node.right == right). Namly, all the right pointer of leaves points to itself.
So I changed your code to be:
Stack search(Node root, Node node, Stack<Integer> path) {
 if (root == null || root.right ==right) return null;
 if (root.equals(node)) return path;
 path.push(0);
if (search(root.left, node, path) != null) return path;
path.pop();
path.push(1);
return search(root.right, node, path);
}I simply tested it with
Stack<Integer> path = new Stack<Integer>();
System.out.println( root, root.right.right, path);
root is the root of a complete binary tree with 7 nodes(4 leaves).
Apparenly, if the path is built correctly search(root, root.right.right, path) would return [1,1] whereas this seach returns [ 0 , 1, 1].
Considerring , the right branch never pops, I changed it into
Then I changed it to :
Stack search(Node root, Node node, Stack<Integer> path) {
 if (root == null || root.right ==right ) return null;
 if (root.equals(node)) return path;
 path.push(0);
if (search(root.left, node, path) != null) return path;
path.pop();
path.push(1);
if (search(root.right, node, path) != null) return path;
path.pop();
return path;
With the same test case, it returns [].
I will keep working on it.
Cheers,
Message was edited by:
since81
Message was edited by:
since81

'Could not find the requested node error' when guests join the meeting room

I am working on a program where the owner would allow guests after they knock to enter the meeting room. Upon acceptance, they would also be permitted to publish/subscribe audio.
My ' meeting owner' application code is an adaptation of the Knocking Queue example. The 'owner app' code has the following settings in its creation complete.
// Require that guests must knock.Note that this line changes the setting of your room so that in future anyone guest coming in
// has to knock.
cSession.roomManager.guestsHaveToKnock = true;
//Enable autopromote
cSession.roomManager.autoPromote =
true;
I get an error when the owner logins in first and accepts the guest into the meeting room.
 // Event handler function for displaying the selected Alert button.
 private function alertClickHandler(event:CloseEvent):void {
 var queue:Array = pendingArray;
 if ( cSession.userManager.myUserRole == UserRoles.OWNER ) {
 var item:Object = pendingArray.shift();
 trace (item["label"]);
 trace (item["descriptor"].userID);
 if (event.detail==Alert.OK)
 //Admit user for chatting
 cSession.roomManager.knockingQueue.acceptUser(item["descriptor"].userID);
 //Allow user to publish audio - supposed to be promoted through room setting
 //audioPub.setUserRole(item.descriptor.userID, UserRoles.PUBLISHER);
 else //if (event.detail==Alert.CANCEL)
 cSession.roomManager.knockingQueue.denyUser(item["descriptor"].userID);
The 'client' application throws the following error.
SWF] C:\Documents and Settings\a246216\My Documents\Flex Builder 3\Client Chat Tool\bin-debug\ClientChatTool.swf - 1,572,471 bytes after decompression
AFCS Beta Build # : 0.92
requestInfo http://connectnow.acrobat.com/fidelity2/ramr?guk=ZzprOg==&mode=xml&x=0.011843591462820768
Getting FMS at https://na2.connectnow.acrobat.com/fms?ticket=1468amkp7k35g, attempt #1/3
result: <fms>
<origin>fms2.acrobat.com</origin>
<proto_ports>rtmps:443</proto_ports>
<retry_attempts>2</retry_attempts>
</fms>
#FMSConnector# Tue May 12 11:26:50 GMT-0400 2009 protocols: [object ProtocolPortPair]
#FMSConnector# Tue May 12 11:26:50 GMT-0400 2009 [attempt 1 of 2] Connecting to 0/0: rtmps://fms2.acrobat.com/cocomo/na2-sdk-825d634c-46ed-4ed3-aa58-7450f0f7e36a/ramr #startProtosConnect#
#FMSConnector# Tue May 12 11:26:50 GMT-0400 2009 tempNetStatusHandler 0/1,NetConnection.Connect.Success
#FMSConnector# Tue May 12 11:26:50 GMT-0400 2009 isTunneling? false
#FMSConnector# Tue May 12 11:26:50 GMT-0400 2009 is using RTMPS? true
RECEIVED LOGIN AT SESSION
.user descriptor from server [object]
 .displayName [string]= k
 .userID [string]= GUEST-110858C2-4F16-4FE8-BF2C-D572F915FEC5
 .affiliation [number]= 5
 .role [number]= 5
RECEIVENODES UserManager
receiveAllSynchData UserManager
checkManagerSync:[object UserManager]
RECEIVENODES FileManager
receiveAllSynchData FileManager
checkManagerSync:[object FileManager]
RECEIVENODES AVManager
receiveAllSynchData AVManager
checkManagerSync:[object StreamManager]
RECEIVENODES RoomManager
receiveAllSynchData RoomManager
checkManagerSync:[object RoomManager]
RECEIVENODES Chat
receiveAllSynchData Chat
Error: Could not find the requested node.
at com.adobe.rtc.sharedModel::CollectionNode/getNodeConfiguration()[C:\work\main\connect\coc omoPlayer10\src\com\adobe\rtc\sharedModel\CollectionNode.as:394]
at com.adobe.rtc.sharedManagers::StreamManager/getNodeConfiguration()[C:\work\main\connect\c ocomoPlayer10\src\com\adobe\rtc\sharedManagers\StreamManager.as:577]
at com.adobe.rtc.collaboration::AudioPublisher/onUserRoleChange()[C:\work\main\connect\cocom oPlayer10\src\com\adobe\rtc\collaboration\AudioPublisher.as:1009]
at flash.events::EventDispatcher/dispatchEventFunction()
at flash.events::EventDispatcher/dispatchEvent()
at com.adobe.rtc.sharedManagers::StreamManager/onUserRoleChange()[C:\work\main\connect\cocom oPlayer10\src\com\adobe\rtc\sharedManagers\StreamManager.as:1410]
at flash.events::EventDispatcher/dispatchEventFunction()
at flash.events::EventDispatcher/dispatchEvent()
at com.adobe.rtc.sharedModel::CollectionNode/http://www.adobe.com/2006/connect/cocomo/messaging/internal::receiveCascadingUserRole()[C: \work\main\connect\cocomoPlayer10\src\com\adobe\rtc\sharedModel\CollectionNode.as:813]
at com.adobe.rtc.messaging.manager::MessageManager/http://www.adobe.com/2006/connect/cocomo/messaging/internal::receiveUserRole()[C:\work\mai n\connect\cocomoPlayer10\src\com\adobe\rtc\messaging\manager\MessageManager.as:715]
at com.adobe.rtc.session.managers::SessionManagerBase/receiveUserRole()[C:\work\main\connect \cocomoPlayer10\src\com\adobe\rtc\session\managers\SessionManagerBase.as:352]
The above error is thrown just when the 'guest' is accepted into the meeting room. The guest has not published anything at this point.
The chat part is working fine.
I have tried different ways to resolve this issue but I am not getting anywhere. I have tried different things. Your help is appreciated.
Ram

It is win 7 64 bit system and same error on Illustrator x86 and x64.

Function module to find the top node in the Profit Center standard hierarch

Hi,
Please let me know the function modules/Tables to do the following.
1. To find the Top node in the Profit center standard hierarchy which is displayed via KCH6N Transaction.
2. To read/retrieve standard hierarchy displayed in KCH6N Transaction.
Thanks in Advance,
Madhuri.

Hi Madhuri ,
have a look @SETLEAF or SET* in se11 , u can get the Top Node by putting the Logic like this
ex: i am searching for Top Node of A3
select setname from setleaf where valfrom eq 'A3'.and for that selected setname u have to do one more
loop.
select setname from setleaf where valfrom eq 'A2'.
then only u will net Node A1.
this is a sample code only , dont check F2.
let me know if u want more inputs of Set Ids.
regards
prabhu
[email protected]
NjoySAP

Finding the largest values of an array without using if condition

Hi,
I am trying to find the largest values of an array without using any if condition. Can any one tell me the solution for that..
Thanks

I am trying to find the largest values of an arrayThe 'S' to values suggests that you want not only the largest one, but multiple ones among the largest ones. The best way, I think, is to sort the array, so that its largest values are grouped topgether. If the type is already Comparable, the following single line does the job:
Collections.sort(myArray);After this, the last values of the array are the largest ones.
Jerome.

Finding the largest value...

Hi guys,
I'm creating a method where it finds the largest value in a list of integers, using a loop. When it finds it, it's stored in the "max" and returns the "max".
Here's the code...
 public Integer findMax()
 List<Integer> list = Arrays.asList(4,8,2,10,24);
 int max = 0;
 for(Integer i = 0 ; i < list.size() ; i++) {
 if(max == list.get(i))
 max = i;
 return max;
 }It complies, but when i run it, it doesn't actually get the largest value (which should be 24). It's still 0 when i Inspect it.
Does anybody know where i'm going wrong with this?

Well i went through the method and it seems to be printing 0 five times...
 public Integer findMax()
 List<Integer> list = Arrays.asList(4,8,2,10,24);
 int max = 0;
 for(Integer i = 0 ; i < list.size() ; i++) {
 if(max >= list.get(i))
 max = list.get(i);
 System.out.println(max);
 return max;
 }After looking looking through the API, i used the length, instead of size, but when i compile the program it says it can't find the method. Do you know what else i have to change or add in the code for it to compile?
DrClap wrote:
if(max == list.get(i)) Can you explain, in words, what this comparison was meant to do?I've edited that, because that's wrong.

Validation to find the Root Node !!!!

Hi All,
Is it possible to write a Validation to find the Root Node of the Hierarchy,
For E.g. If we have a three level hierarchy
Printer
Dot Matrix
T123
So is there a way I can check if my Root node value is Printer or not, because in Data Manager the value that is selected from the hierarchy drop down is the leaf node.
Regards,
Parul

Hi Jitesh,
The solution is as follows:
MDM does not give us the option to traverse to the grandparent of the leaf node..
In the example that we have taken :
Printer
- Dot Matrix
- Laser
--Laser1
--Laser2
Here if we want to check if the Grandparent of Laser1 is Printer, this cannot be done using the simple Validation, because through validation also we can at max find the parent of the current node i.e. we can traverse till Laser (for Laser 1 leaf node).
Further we cannot use Laser as the node because in MDM we have to traverse completely through the last node and select it in Data Manager. So again we cannot search for Laser -> Parent.
The Work Around that I have used is :
I have created a new field and every time I import data I have mapped this field with the first Level Node and have put the Validation on this field.
Eg: The field name is Root Node, so everytime the data is imported, Level 1 is mapped to Root Node and so all the Root node values are imported in the Root Node field that we have created and everytime the Validation Runs on this Root Node field and accordingly the process follows.
Hope that would be helpful to you all!!!!
Regards,
Parul Malhotra

Finding the "last node" in a hierarchical query?

I'm presented with an issue - find all parent records for which the "last node" in a hierarchy is not set to some value.
Table structure:
child_id number
parent_id number
type_id number
So, I need to find all parents whose eventual last "children" (could be several levels deep, it varies) do not have a type_id of 29.
I can find the hierarchy easily using connect by prior but I'm stuck on that "last node" bit. Any help out there?

user9937402 wrote:
I'm finding that the CONNECT_BY_ISLEAF is showing all leaves set to 0, even if they themselves are parents (i.e. not the last node in the tree).
Post your code.
I'm not following the 2nd example. Where are you getting those values? This is a really large table, so if that is actual data ... that won't work.Since you did not post data sample, SBH cooked up one on-the-fly using subquery factoring clause - WITH. Below is example on existing table, so I don't need to use WITH:
SQL> select lpad(' ',level*2) || ename ename,
2          connect_by_isleaf
3    from emp
4    start with mgr is null
5    connect by mgr = prior empno
6 /
ENAME                                                                CONNECT_BY_ISLEAF
KING                                                                               0
    JONES                                                                            0
      SCOTT                                                                          0
        ADAMS                                                                        1
      FORD                                                                           0
        SMITH                                                                        1
    BLAKE                                                                            0
      ALLEN                                                                          1
ENAME                                                                CONNECT_BY_ISLEAF
      WARD                                                                           1
      MARTIN                                                                         1
      TURNER                                                                         1
      JAMES                                                                          1
    CLARK                                                                            0
      MILLER                                                                         1
14 rows selected.
SQL> As you can see CONNECT_BY_ISLEAF works as expected.
SY.

How to find the level of an n-ary tree

I have a n-ary tree. I traverse this tree using Breadth First and using queues to store the nodes that I encounter.
Can anyone tell me how to find the current level I am in this n-ary tree

How do I do that...My mind is drawing a blank totally
This code does a breadth first traversal
private void processTree(Node node) {
LinkedList queue = new LinkedList();
queue.addLast(node);
while (queue.size() > 0) {
 Node node1 =(Node)queue.removeFirst();
 if (node1 != null) {
 processNode(node1);//Do some processing on this node
 NodeList nodeList = node1.getChildNodes();
 for (int i = 0; i < nodeList.getLength(); i++) {
 queue.addLast(nodeList.item(i));
Using this how can I determine the level. Since Im visiting each node of a particular level how do I know that a level is over and Im now visitng the next level?

How to get the selected node value of a tree which is build on java code

Hi Experts,
How can i get the selected node value if I build the tree programatically.
I am using the following code in selectionListener but it is throwing error.
RichTreeTable treeTable = (RichTreeTable)getQaReasontreeTable();
CollectionModel _tableModel =
(CollectionModel)treeTable.getValue();
RowKeySet _selectedRowData = treeTable.getSelectedRowKeys();
Iterator rksIterator = _selectedRowData.iterator();
String selectedQaCode ="";
while (rksIterator.hasNext()) {
List key = (List)rksIterator.next();
JUCtrlHierBinding treeTableBinding =
(JUCtrlHierBinding)((CollectionModel)treeTable.getValue()).getWrappedData();
JUCtrlHierNodeBinding nodeBinding =
treeTableBinding.findNodeByKeyPath(key);
String nodeStuctureDefname =
nodeBinding.getHierTypeBinding().getStructureDefName();
selectedQaCode = selectedQaCode + nodeBinding.getAttribute(0);
where I am using following link to create a tree with java code.
http://one-size-doesnt-fit-all.blogspot.com/2007/05/back-to-programming-programmatic-adf.html
Please help me in resolving this issue.
Regards
Gayaz

Hi,
you should also move
JUCtrlHierBinding treeTableBinding =
(JUCtrlHierBinding)((CollectionModel)treeTable.getValue()).getWrappedData();
out of the while loop as this is not necessary to be repeated for each key in the set
Frank

How to find the largest tables in EBS

Hi gurus,
Oracle EBS R12.1.2
Linux x86-64
RDBMS 11g
How can I find the top 10 largest tables in EBS - in terms of size (KB/MB)? pls send me the Query and also direction from where (which Schema) should I run that query?
-- TIA

Hi;
I suggest check below threads:
How to know which is the largest table in my oracle database??
Find Largest Tables in 9i Database
Query to find biggest table in oracle ERP database?
Those links should give you answer of your questions.
Regard
Helios

How to find the largest odd number and smallest even number from an array

Hello All
I want to find out largest odd number and the smallest even number from an arry numbers? What is the best method to achieve this.
Thanks
Sravz

You need to sit down and figure out an algo on how you would do it if you had to do the same thing from a blind container perspective:
1 - collect all the items you want to look at
2 - look at an item
3 - is it odd?
4 - if it is odd then check if it is larger than previously largest number
5 - save it if it is larger
6 - return back to 2 unless no more items
7 - item is not odd so it must be even--is it smaller than previous
8 - save it if it is smaller
9 - return back to 2 unless no more items
Now you just need to know how to check if something is even or odd: to do this you will need the modulous operator--integer division.
Note: this all assumes that your needs are for integer type of numbers, otherwise there is not enough information to define an answer. For instance, if you are using floats at 0.5--it that even or odd? Do you consider an err factor when dealing with floats? etc...

Locating the Insertion Node in a Heap Tree

Hello,
I'm working on creating a Heap Tree, but I can see a problem before I even begin. Could someone please show me a method that locates the insertion node? I know it has something to do with traversing the tree, but I have no clue how to even begin implementing it.

Anyone know how to do this? I really have no idea how to do this. Please help!

How can I find the largest BLOB in a table and how big it is?

Hi
I have a massive table with 10 million rows storing images as BLOBS as well as some other data.
Is there a way that I can find which is the largest BLOB in it and how big it is?
Any help would be appreciated
Flaz

select max(dbms_lob.getlength(blob_column)) from table
remove the max to get the length.

FINDING THE LARGEST NODE IN A BINARY TREE

Similar Messages

Maybe you are looking for