Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with queue
Search options not deleted
user 64908
A queue is an ordered, first-in-first-out (FIFO) data structure. Typical implementations of queues support pushing elements to the back and popping them off the front position.
3
votes
1
answer
4k
views
Sum of left and right nodes (individually) in a Binary Search Tree
right nodes is as follows\n");
sumOfLeftandRightNodes(root);
}
public static void sumOfLeftandRightNodes(Node root) {
// TODO Auto-generated method stub
long leftSum = 0, rightSum = 0;
Queue … <Node> nodes = new LinkedList<Node>();
//add the root to the Queue
nodes.add(root);
List<Node> leftNodes = new ArrayList<Node>() , rightNodes = new ArrayList<Node>();
while (! …
- 333
6
votes
1
answer
41k
views
Printing a tree level by level
have have 2^L elements where L is the level, root is level L=0
* @param Root of the tree of type {@link Node}
*/
public void printLevelWise(Node root) {
// TODO Auto-generated method stub
Queue … This function traverses the tree and puts all the nodes level wise into a list
* @param root
* @param listOfNodes
* @param nodes
*/
private void traverseLevels(Node root, List<Node> listOfNodes, Queue …
- 333