Nth largest element in a binary search tree

Posted by Codenotguru on Stack Overflow See other posts from Stack Overflow or by Codenotguru
Published on 2010-04-10T05:24:29Z Indexed on 2010/04/10 5:33 UTC
Read the original article Hit count: 424

Filed under:

binary-trees

|

homework

How to find the Nth largest node in a BST?

Do I keep a count variable while doing In Order Traversal of a BST? Return the element when the count = N???

© Stack Overflow or respective owner

Related posts about binary-trees

Binary Trees in Scheme

as seen on Stack Overflow - Search for 'Stack Overflow'
Consider the following BNF defining trees of numbers. Notice that a tree can either be a leaf, a node-1 with one subtrees, or a node-2 with two subtrees. tree ::= (’leaf number) | (’node-1 tree) | (’node-2 tree tree) a. Write a template for recursive procedures on these trees. b. Define the procedure… >>> More
C++ design question on traversing binary trees

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a binary tree T which I would like to copy to another tree. Suppose I have a visit method that gets evaluated at every node: struct visit { virtual void operator() (node* n)=0; }; and I have a visitor algorithm void visitor(node* t, visit& v) { //do a preorder traversal using… >>> More
Priority queues and Binary trees

as seen on Stack Overflow - Search for 'Stack Overflow'
Trying to create a game using priority queues and binary tree, for example a solitaire game. I hope this is not to vague? >>> More
What are the applications of binary trees?

as seen on Stack Overflow - Search for 'Stack Overflow'
I am wondering what the particular applications of binary trees are. Could you give some real examples? Thanks. >>> More
A deque based on binary trees

as seen on Programmers - Search for 'Programmers'
This is a simple immutable deque based on binary trees. What do you think about it? Does this kind of data structure, or possibly an improvement thereof, seem useful? How could I improve it, preferably without getting rid of its strengths? (Not in the sense of more operations, in the sense of different… >>> More

Related posts about homework

parsing a list and producing a structure of that

as seen on Stack Overflow - Search for 'Stack Overflow'
;; structure representing homework points ;; nr: number - the number of the homework ;; points: number - the number of points reached (define-struct homework (nr points)) ;; parse-homework: (list of number pairs) -> (list of homework) ;; The procedure takes a list of number pairs and produces… >>> More
Scheme homework help

as seen on Stack Overflow - Search for 'Stack Overflow'
Okay so I have started a new language in class. We are learning Scheme and i'm not sure on how to do it. When I say learning a new language, I mean thrown a homework and told to figure it out. A couple of them have got me stumped. My first problem is: Write a Scheme function that returns true (the… >>> More
Unix [Homework]: Get a list of /home/user/ directories in /etc/passwd

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm very new to Unix, and currently taking a class learning the basics of the system and its commands. I'm looking for a single command line to list off all of the user home directories in alphabetical order from the /etc/passwd directory. This applies only to the home directories, and not the contents… >>> More
[Homework] Online programming editor

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, For a school project i need to write or use a online programming editor. It is a part of a bigger project. I thought of a java application, php/html/javascript or flash. I have a couple of things i could do: Find a good working application and edit it so it works with the rest of the project Find… >>> More
sequential search homework question

as seen on Stack Overflow - Search for 'Stack Overflow'
Consider a disk file containing 100 records a. How many comparisons would be required on the average to find a record using sequential search, if the record is known to be in the file? I figured out that this is 100/2 = 50. b. If the record has a 68% probability of being in the file, how many comparisons… >>> More