Consider the following problem:
You are given a pointer to the root r of a binary tree, where each vertex v has pointers v. lc and v. rc to the left and right child, and a value V al(v) > 0 . The value NIL represents a null pointer, showing that v has no child of that type. You wish to find the path from r to some leaf that maximizes the total values of vertices along that path.
(a) Give an algorithm to find the maximum sum of vertices along such a path along with a proof of correctneess and runtime analysis

Which are examples of note-taking tools? check all that recording devices sticky notes digital highlighters paper flags highlighting pens digital displays digital flags

Which statistical function in a spreadsheet you to see how far each number varies, on average, from the average value of the list?

Design a class tictactoe that: holds the following information about the game: two-dimensional array (3 by 3), and winner. add additional variables as needed. includes the functions to perform the various operations on objects. for example, function to print the board, getting the move, checking if move is valid, determining if there is a winner after each move. add additional operations as needed. includes constructor(s). write the functions of the class, and write a program that uses the class. the program should declare an object of type tictactoe. the program will create the board and store it in the array. the program will allow two players to play the tic-tac-toe game. after every valid move update the array, check if there is a winner. if there is no winner and no tie, then print the board again to continue.