1. Write the function smaller than(t,k) that receives a reference to a binary search tree t and an integer k and returns a sorted list containing all the keys in the tree that are smaller than k. Make sure your function does not visit unnecessary nodes. For example, if t is the tree below, smaller than(t, 7) should return [2,4,6] and not visit the right subtree of t.

1. Write the function smaller than(t,k) that receives a reference to a binary search tree t and an integer k and returns a sorted list containing all the keys in the tree that are smaller than k. Make sure your function does not visit unnecessary nodes. For example, if t is the tree below, smaller than(t, 7) should return [2,4,6] and not visit the right subtree of t.

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

Q. No. 1. Write a program that implement a generic binary search tree of the nodes 19, 2, 70, 5, 3, 20, 3, 3,40, 50, 82, 1, 2, 15. Create a function for searching 90 in the developed binary search tree. and traverse the tree following in order traversal.
Write a function f1 that takes the root of a binary tree as a parameter and returns thesum of the nodes which are in the right subtree of the root. You must not consider the valueof the root in the final sum.
Create a function that rapidly identifies whether any two nodes u and v in a tree T with s as the root node are ancestors or descendants of each other.
python: In a binary search tree, write another way of function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p): root=p def helper(root, l, r): if not root: return True if not (left<root.val and root.val<right): return False return helper(root.l, l, root.val) and helper(root.r, root.val, r) return helper(root, float('-inf'), float('inf'))
Using the simulated link technique, create an array version of a binary search tree based on an array implementation of a binary tree. Each array element must keep a reference to the data element put there as well as the array locations of the left and right children. You must also keep a list of accessible array positions where elements have been deleted so that you may reuse those slots.
Write a program of binary tree using linked list. Elements of this linked list should be of integer type, user will provide values as input for elements of binary tree. Your program should allow insert new node, searching node of a value specified by user in binary tree and if the node on leaf than allow delete the node specified by user.
Create a function that takes an array that represent a Binary Tree and a value and return true if the value is in the tree and, false otherwise. Examples valueInTree (arr1, 5) valueInTree (arr1, 9) valueInTree (arr2, 51) - true 1 false false
Create a function that takes an array that represent a Binary Tree and a value and return true if the value is in the tree and, false otherwise. Examples valueInTree (arr1, 5) true valueInTree (arr1, 9) → false valueInTree (arr2, 51) → false
Write a function that inserts the nodes of a binary tree into an ordered linked list. Also write a program to test your function.
Create a function that uses Node * pointing to root of AVL Tree as an input and returns the height of the AVL tree in O(log(n)).
Question 5: Add Leaves Implement add_d_leaves, a function that takes in a Tree instance t and mutates it so that at each depth d in the tree, d leaves with labels v are added to each node at that depth. For example, we want to add 1 leaf with v in it to each node at depth 1, 2 leaves to each node at depth 2, and so on. Recall that the depth of a node is the number of edges from that node to the root, so the depth of the root is 0. The leaves should be added to the end of the list of branches. def add_d_leaves(t, v): """Add d leaves containing v to each node at every depth d. > > > t1 = Tree(1, [ Tree(3)]) > > > add_d_leaves(t1, 4) > > > t1 Tree(1, [Tree(3, [Tree(4)])]) > > > t2 = Tree(2, [Tree(5), Tree (6)]) > > > t3 = Tree(3, [t1, Tree(0), t2]) > > > add_d_leaves (t3, 10) > > > print(t 3) 3 1 3 4 10 10 10 10 10 10 0 10 2 5 10 10 6 10 10 10 """ def add_leaves(t, d): "*** YOUR CODE HERE **** add_leaves (t, 0)
Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follow: //PICTURE// You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Also Count the height of the tree. PLEASE USE C LANGUAGE