Consider this algorithm (described in pseudocode): void traverse(tree_node ptr) { } if (ptr!=null) { traverse(ptr.left_child()); print(ptr.data()); traverse(ptr.right_child()); } 18. Which traversal method does this algorithm describe?

Consider this algorithm (described in pseudocode): void traverse(tree_node ptr) { } if (ptr!=null) { traverse(ptr.left_child()); print(ptr.data()); traverse(ptr.right_child()); } 18. Which traversal method does this algorithm describe?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Assume we already have class for binary search tree called BinarySearchT, you have access to the following methods (assume they are coded) public class BSTNode<E> { public int key; public E value; public BSTNode left; public BSTNode right; } public class BinarySearchT<E> { private BSTNode root; public void insert(int key, E value) { ... } public void delete(int key) { ... } public <E> find(int key) { ... } } you are asked to only code a method public int treeH() to the BinarySearchT class that computes the height of the tree. Hint: You can use a helper method. Hints: you should use a helper function I would do it with recursion the key and value has no effect on this remember what is the definition of the height with respect the depths of nodes you can use Math.max(a,b) that would return the max between a and b, but if you prefer, you also can do it with loops Note: make sure the name of the method matches
Question 8 Given the following recursive method, what would be the output assuming that the root is the passing value to node parameter private int unknown(Node<Integer> node) { if (node == null) return 0; else return( 2*node.data + unknown(node.left)); } a. It will return the double of the summation of the left subtree of the root. b. It will return the summation of double of the data of the root with the data values of the subtree of the root node. c. It will return the double of the summation of the root node. d. It will return the double of the summation of the data of the root node and only the data of the left nodes of the left subtree of the root node.
transfer the code bellow to algorithms public static void printLeafNodes(TreeNode node) { // base case if (node == null) { return; } if (node.left == null && node.right == null) { System.out.printf("%d ", node.value); } printLeafNodes(node.left); printLeafNodes(node.right); }
What does the following recursive method do, if called from another public method, where the parameter p is reference to the tree root? private int undefined_Method(Node p) { if ( p == null ) return 0; if ( p.left == null || p.right = null) return p.data; if (p.left != null && p.right = null) return p.data + undefined_Method(p.left) + undefined_Method(p.right); else return undefined_Method(p.left) + undefined_Method(p.right); A It returns the summation of data of leaf nodes and nodes having two child nodes. B It returns the summation of data of the leaf nodes and nodes having only left child. (c) It returns the summation of data of the leaf nodes and nodes having only right child. D It returns the summation of the data of all the nodes.
bool DelOddCopEven(Node* headPtr) { if (headPtr == nullptr) { return false; } Node* prev = nullptr; Node* current = headPtr; while (current != nullptr) { if (current->data % 2 != 0) { // Odd-valued node, delete it if (prev != nullptr) { prev->link = current->link; } else { headPtr = current->link; } Node* temp = current; current = current->link; delete temp; } else { // Even-valued node, create a copy and insert it after the original node Node* newNode = new Node; newNode->data = current->data; newNode->link = current->link; current->link = newNode; // Update the previous and current pointers prev = newNode; current = newNode->link; } } return true;} int FindListLength(Node* headPtr){ int length = 0;…
Question 5 what does the following method do? private void reOrder (Node node) { if (node == null) return; else { reOrder (node.left); reorder (node.right); System.out.print (node.data + " "); } } (A) getLeft Subtree B) postOrder Traverse c) inOrder Traverse preorder Traverse
class IntBTNode { private int data; private IntBTNode left; private IntBTNode right; } Write a new static method of the IntBTNode class to meet the following specification. Make the method as efficient as possible (do not visit nodes unnecessarily). public static int max(BTNode root) // Precondition: root is the root reference of a nonempty binary SEARCH // tree. // Postcondition: The return value is the largest value in the tree.
simulate the given. c++ language
IN JAVA LANGUAGE ALL INFORMATION IN PICTURES FIND MIN OF A BST CALL ON A RECURSIVE FINDMIN_R THAT WILL RETURN THE SMALLEST ELEMENT IN A BST THANK YOU!!!!!!!!!!!
In Java, Complete the incomplete method of ExpressionTree.java. The incomplete methods are private Node parsePrefix(Scanner input) // Required public void parseInfix(String string) // Optional public void parsePostfix(String string) // Optional Implementations of parseInfix and parsePostfix require use of a stack. Implementation of parsePrefix does not. Read all of the ExpressionTree.java file before starting your implementation, so that you see the helper methods that are provided and get an idea of the context for your implementation. Although not needed for your implementation, you should be sure you understand how the toStringPrefix, toStringInfix, and toStringPostfix methods work. Note: The main() method accepts a single String as its argument. The String should be a prefix, infix, or postfix mathematical expression with no characters other than operators (+, -, *, and /) and operands (single characters a-z). As written, the main() method calls parsePrefix() to create an…
def has_at_least(queue: Queue, n: int) -> bool:"""Return true iff queue contains at least n items. Precondition: n >= 0 >>> queue = Queue()>>> queue.enqueue(1)>>> queue.enqueue(2)>>> queue.enqueue(3)>>> has_at_least(queue, 3)True"""
Complete the method to perform breadth first traversal (search) here is the method: private static void breadthFirst() { //Todo System.out.println("test"); }here is the complete source code: Graph.java---------------------------------package finlab;import java.util.*;public class Graph { List<Edge>[] list; public Graph(int n){ list = new LinkedList[n]; for(int i=0; i<list.length;i++){ list[i] = new LinkedList<>(); } } void addEdge(int u, int v, int w){ list[u].add(0,new Edge(v,w)); } boolean isConnected(int u, int v){ for(Edge e: list[u]) { if (e.v == v) return true; } return false; } @Override public String toString(){ String result= ""; for(int i=0; i<list.length; i++){ result+= i+": "+list[i]+"\n"; } return result; }}Edge.java--------------------------------------------------------package…