For both of the following questions, you were given the code for a node in the tree, which had data, parent, left, and right data fields. The interview was in C: 1. Given a root node of a binary search tree, find the smallest node in the tree. 2. Given a node in a binary search tree, find the next largest node in the tree.
Explain the différence between char[] and char*
Given a list of tasks where some tasks have prerequisites, output in the correct order all the tasks you have to do to complete the specified task.
binary search tree attributes, and find successor node.
Explain the OSPF neighbour stage in detail? what happens at each stage
Pointer vs reference value, trees, design
Please debug this Java function.
Coding questions. Binary Search in a rotated array. Binary Tree insert and delete.
Find missing in an ordered array
Background and personal goals at an internship
Viewing 1791 - 1800 interview questions